#include <bits/stdc++.h>

#define mem(a, b) memset(a, b, sizeof(a))

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define rep(i, a, n) for(int i=a; i<n; i++)

#define lap(i, a, n) for(int i=n; i>=a; i--)

#define lep(i, a, n) for(int i=n; i>a; i--)

#define rd(a) scanf("%d", &a)

#define rlld(a) scanf("%lld", &a)

#define rc(a) scanf("%c", &a)

#define rs(a) scanf("%s", a)

#define pd(a) printf("%d\n", a);

#define plld(a) printf("%lld\n", a);

#define pc(a) printf("%c\n", a);

#define ps(a) printf("%s\n", a);

#define MOD 2018

#define LL long long

#define ULL unsigned long long

using namespace std;

const int maxn = , INF = 0x7fffffff;

int d[maxn], head[maxn], in[maxn], low[maxn], id[maxn], cur[maxn];

int n, m, s, t, ans_flow, ans, cnt, k, ss, tt;

struct node{

    int u, v, c, next;

}Node[maxn<<];

void add_(int u, int v, int c)

{

    Node[cnt].u = u;

    Node[cnt].v = v;

    Node[cnt].c = c;

    Node[cnt].next = head[u];

    head[u] = cnt++;

}

void add(int u, int v, int c)

{

    add_(u, v, c);

    add_(v, u, );

}

int bfs()

{

    queue<int> Q;

    mem(d, );

    Q.push(s);

    d[s] = ;

    while(!Q.empty())

    {

        int u = Q.front(); Q.pop();

        for(int i=head[u]; i!=-; i=Node[i].next)

        {

            node e = Node[i];

            if(!d[e.v] && e.c > )

            {

                d[e.v] = d[e.u] + ;

                Q.push(e.v);

                if(e.v == t) return ;

            }

        }

    }

    return d[t] != ;

}

int dfs(int u, int cap)

{

   int ret = ;

    if(u == t || cap == )

        return cap;

    for(int &i=cur[u]; i!=-; i=Node[i].next)

    {

        node e = Node[i];

        if(d[e.v] == d[e.u] +  && e.c > )

        {

            int V = dfs(e.v, min(cap, e.c));

            if(V > )

            {

                Node[i].c -= V;

                Node[i^].c += V;

                ret += V;

                cap -= V;

                if(cap == ) break;

            }

        }

    }

    if(cap > ) d[u] = -;

    return ret;

}

int Dinic(int u)

{

    int sum_flow = ;

    while(bfs())

    {

        memcpy(cur, head, sizeof(head));

        sum_flow += dfs(u, INF);

    }

    return sum_flow;

}

int main()

{

    int l, r;

    int kase = ;

    while(~scanf("%d%d%d", &n, &m, &k))

    {

        ans_flow = ;

        mem(head, -);

        mem(in, );

        cnt = ;

        rd(l), rd(r);

        ss = n+m+, tt = n+m+;

        s = , t = n+m+;

        int u, v;

        for(int i=; i<k; i++)

        {

            rd(u), rd(v);

            add(u, n+v, );

        }

        for(int i=; i<=n; i++)

        {

            add(ss, i, r-l);

            add(s, i, l);

        }

        for(int i=; i<=m; i++)

        {

            add(n+i, tt, r-l);

            add(n+i, t, l);

        }

        add(ss, t, l*n);

        add(s, tt, l*m);

        add(tt, ss, INF);

        ans_flow = l*(n+m);

        int sum_flow = Dinic(s);

        printf("Case %d: ", ++kase);

        if(sum_flow == ans_flow)

            puts("Yes");

        else

            puts("No");

    }

    return ;

}