#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<iomanip>
using namespace std;
int n,m,k;
int hand;
int enemy,us;
int maxn=0;
struct card
{
	int money,power,died;
}a[100010];
bool mymaps(card a,card b)
{
	if(a.power==b.power) return a.money<b.money;
	return a.power>b.power;
}
int main()
{
	freopen("gwent_grandorder.in","r",stdin);
	freopen("gwent_grandorder.out","w",stdout);
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)
	{
		int q,w,e,r,t;
		scanf("%d%d%d%d%d",&q,&w,&e,&r,&t);
		if(w==2 || t==1)
		{
			cout<<"SingleDogMZX"<<endl;
			return 0;
		}
		if(t==1) us+=e;
		enemy+=e;
	}
	for(int i=1;i<=m;i++)
	{
		int q,w,e,r;
		scanf("%d%d%d%d%d",&a[i].money,&q,&a[i].power,&w,&a[i].died);
	}
	hand=k;
	sort(a+1,a+m+1,mymaps);
	for(int i=1;i<=m;i++)
	{
		us+=a[i].power;
		maxn=max(a[i].money,maxn);
	}
	if(us>=enemy) cout<<maxn<<endl;
	else cout<<"SingleDogMZX"<<endl;
	return 0;
}