#include<bits/stdc++.h>
#define FL(i,a,b) for(ll i=(a);i<=(b);i++)
#define FR(i,a,b) for(ll i=(a);i>=(b);i--)
#define ll long long
#define PII pair<ll,ll>
using namespace std;
const ll MAXN = 1e5 + 10;
ll n,w,h,sum[2];
vector<PII>E[MAXN];
struct BIT{
	#define lowbit(x) x&(-x)
	ll c[MAXN];
	void update(ll x,ll k){
		while(x<=n){
			c[x]+=k;
			x+=lowbit(x);
		}
	}
	ll query(ll x){
		ll res=0;
		while(x){
			res+=c[x];
			x-=lowbit(x);
		}
		return res;
	}
}T;
signed main(){
	scanf("%lld%lld%lld",&n,&w,&h);
	FL(i,1,n){
		ll a,b,x;
		scanf("%lld%lld%lld",&a,&b,&x);
		E[x].push_back({i,b});
		E[x+a].push_back({i,-b});
	}
	FL(i,1,w){
		for(PII j:E[i]) T.update(j.first,j.second);
		ll l=1,r=n,ans=-1;
		while(l<=r){
			ll mid=(l+r)>>1;
			if(T.query(mid)>=h) ans=mid,r=mid-1;
			else l=mid+1;
		}
		if(ans!=-1) sum[ans&1]++;
	}
	if(sum[1]>sum[0]) puts("A");
	else if(sum[1]<sum[0]) puts("B");
	else puts("DRAW");
//	printf("%lld %lld\n",sum[1],sum[0]);
}