#include <iostream>
#include <algorithm>
using namespace std;

struct School
{
	int num;
	int wf;
	int pc;
};

struct Team
{
	int school;
	int question;
};

School sc[102];
Team team[2000];
int sd[102];

int main()
{
	int s,t,m,i,sum,j = 1;
	while(scanf("%d%d%d",&s,&t,&m))
	{
		if(s==0&&t==0&&m==0)
			break;
		for(i=0; i<2000; i++)
		{
			team[i].school = 0;
			team[i].question = 0;
		}
		for(i=0; i<102; i++)
		{
			sc[i].num = 0;
			sc[i].wf = 0;
			sc[i].pc = 0;
			sd[i] = 0;
		}
		sum = 0;
		for(i=0; i<s; i++)
		{
			scanf("%d%d%d", &sc[i].num, &sc[i].wf, &sc[i].pc);
		}
		for(i=0; i<t; i++)
		{
			scanf("%d%d", &team[i].school, &team[i].question);
		}
		for(i=0; i<s; i++)
		{
			if(sc[i].wf)
			{
				sd[sc[i].num]++;
				sum++;
			}
			if(sc[i].pc)
			{
				sd[sc[i].num]++;
				sum++;
			}
		}
		for(i=0; i<t; i++)
		{
			if(team[i].question>=m)
			{
				if(sd[team[i].school]<3)
				{
					sd[team[i].school]++;
					sum++;
				}
			}		
		}
		printf("Case %d: %d\n",j++,sum);
	}
	return 0;
}