#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<48||ch>57){if(ch=='-')f=-1;ch=getchar();}
	while(ch>=48&&ch<=57)x=(x<<1)+(x<<3)+(ch&15),ch=getchar();
	return x*f;
}
inline void write(int x)
{
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+48);
	return;
}
constexpr int M=1e5+4;
struct BIT
{
	int n,tr[M*10];
	inline int lowbit(int x){return x&(-x);}
	inline void add(int x,int v){for(int i=x;i<=n;i+=lowbit(i))tr[i]+=v;return;}
	inline int query(int x){int res=0;for(int i=x;i;i-=lowbit(i))res+=tr[i];return res;}
}T;
struct Operation{int id,v;};
vector<Operation>p[M];
signed main()
{
	int n=read(),w=read(),h=read();
	T.n=n;
	for(int i=1;i<=n;++i)
	{
		int a=read(),b=read(),x=read();
		p[x].emplace_back((Operation){i,b});
		p[x+a].emplace_back((Operation){i,-b});
	}
	int A=0,B=0;
	for(int i=1;i<=w;++i)
	{
		for(auto&t:p[i])T.add(t.id,t.v);
		int l=1,r=n,res=-1;
		while(l<=r)
		{
			int mid=(l+r)>>1;
			if(T.query(mid)>=h)res=mid,r=mid-1;
			else l=mid+1;
		}
		if(~res)res&1?++A:++B;
	}
	puts(A>B?"A":(A<B?"B":"DRAW"));
	//write(A),putchar(' '),write(B);
	return 0;
}