#include <iostream>
#include <vector>

struct node {
	node *l = nullptr;
	node *r = nullptr;
	long long add = 0;
};

constexpr int N = 1 << 17;

node *update(node *x, int k, long long v, int l = 0, int r = N) {
	x = x ? new node(*x) : new node();
	x->add += v;
	if (r - l == 1) return x;
	int m = (l + r) / 2;
	if (k < m) {
		x->l = update(x->l, k, v, l, m);
	} else {
		x->r = update(x->r, k, v, m, r);
	}
	return x;
}

long long query(node *x, int k, int l = 0, int r = N) {
	if (!x) return 0;
	if (k <= l) return 0;
	if (r <= k) return x->add;
	long long vl = query(x->l, k, l, (l + r) / 2);
	long long vr = query(x->r, k, (l + r) / 2, r);
	return vl + vr;
}

int main() {
	int n, w;
	long long h;
	std::cin >> n >> w >> h;

	std::vector<node *> segs(n + 1);

	for (int i = 0; i < n; i++) {
		int a, b, x;
		scanf("%d %d %d", &a, &b, &x);
		x--;
		
		segs[i + 1] = segs[i];
		segs[i + 1] = update(segs[i + 1], x, b);
		segs[i + 1] = update(segs[i + 1], x + a, -b);
	}

	int A = 0;
	int B = 0;
	for (int i = 0; i < w; i++) {
		int ok = n;
		int ng = 0;
		while (ok - ng > 1) {
			int mid = (ok + ng) / 2;
			if (query(segs[mid], i + 1) >= h) {
				ok = mid;
			} else {
				ng = mid;
			}
		}
		if (ok % 2 == 1) {
			A++;
		} else {
			B++;
		}
	}

	puts(A > B ? "A" : A < B ? "B" : "DRAW");
}