#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <algorithm>

#include <cstring>

#include <stack>

#include <cctype>

#include <queue>

#include <string>

#include <vector>

#include <set>

#include <map>

#include <climits>

#define lson root<<1,l,mid

#define rson root<<1|1,mid+1,r

#define fi first

#define se second

#define ping(x,y) ((x-y)*(x-y))

#define mst(x,y) memset(x,y,sizeof(x))

#define Min(x,y) (x<y?x:y)

#define Max(x,y) (x>y?x:y)

using namespace std;

#define gamma 0.5772156649015328606065120 //欧拉常数

#define MOD 100000007

#define inf 0x3f3f3f3f

#define N 100050

#define maxn 10001000

typedef long long LL;

typedef pair<int,int> PII;

int n,m,k,a[N<<],res[N<<],cnt,b[N];

PII p[N];

int main()

{

    int i,j,x,y,v,group,Case=;

    while(scanf("%d%d%d",&n,&m,&k)!=EOF)

    {

        cnt=;

        mst(res,);

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

            scanf("%d\n",&b[i]);

        p[].fi=;

        a[cnt++]=;

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

        {

            scanf("%d%d",&p[i].se,&p[i+].fi);

            ++p[i].se;

            ++p[i+].fi;

            a[cnt++]=p[i].se;

            a[cnt++]=p[i+].fi;

        }

        --cnt;

        stable_sort(a,a+cnt);

        cnt=unique(a,a+cnt)-a;

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

        {

            int l=lower_bound(a,a+cnt,p[i].fi)-a;

            int r=lower_bound(a,a+cnt,p[i].se)-a;

            ++res[l]; --res[r];

        }

        for(i=; i<cnt; ++i)

            res[i]+=res[i-];

        int ans=;

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

        {

            int pos=upper_bound(a,a+cnt,b[i])-a-;

            if(res[pos]>=k)  ++ans;

        }

        printf("Case %d: %d\n",++Case,ans);

    }

    return ;

}