import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

class Main {
	public static void main(String[] args) throws IOException {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int w = sc.nextInt();
		long h = sc.nextLong();
		int[] a = new int[n];
		long[] b = new long[n];
		int[] x = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
			b[i] = sc.nextLong();
			x[i] = sc.nextInt();
			--x[i];
		}
		RMS rms = new RMS(w);
		int[] ps = new int[2];
		for (int i = 0; i < n; ++i) {
			rms.update(x[i], x[i] + a[i], b[i]);
			while (rms.query(x[i], x[i] + a[i])[0] >= h) {
				int idx = (int) rms.query(x[i], x[i] + a[i])[1];
				rms.update(idx, idx + 1, -rms.INF);
				++ps[i % 2];
			}
		}
		if (ps[0] > ps[1]) {
			System.out.println("A");
		} else if (ps[0] < ps[1]) {
			System.out.println("B");
		} else {
			System.out.println("DRAW");
		}

	}

	class RMS {
		int n;
		long[][] v;
		final long INF = Long.MAX_VALUE / 16;
		long[] lazy;

		public RMS(int n) {
			this.n = 1;
			while (this.n < n) {
				this.n *= 2;
			}
			n = this.n;
			v = new long[2 * n - 1][2];
			lazy = new long[2 * n - 1];
			for (int i = 0; i < n; ++i) {
				v[i + n - 1][1] = i;
			}
			for (int i = n - 2; i >= 0; --i) {
				v[i] = merge(v[2 * i + 1], v[2 * i + 2]);
			}
		}

		void push(int k) {
			v[k][0] += lazy[k];
			if (k < n - 1) {
				lazy[2 * k + 1] += lazy[k];
				lazy[2 * k + 2] += lazy[k];
			}
			lazy[k] = 0;
		}

		long[] merge(long[] o1, long[] o2) {
			if (o1[0] > o2[0]) {
				return new long[] { o1[0], o1[1] };
			} else {
				return new long[] { o2[0], o2[1] };
			}
		}

		long[] update(int a, int b, long add) {
			return query(a, b, 0, n, 0, add);
		}

		long[] query(int a, int b) {
			return update(a, b, 0);
		}

		long[] query(int a, int b, int l, int r, int k, long add) {
			push(k);
			if (b <= l || a >= r) {
				return new long[] { -INF, -1 };
			} else if (a <= l && r <= b) {
				lazy[k] += add;
				push(k);
				return v[k];
			} else {
				long[] vl = query(a, b, l, (l + r) / 2, 2 * k + 1, add);
				long[] vr = query(a, b, (l + r) / 2, r, 2 * k + 2, add);
				v[k] = merge(v[2 * k + 1], v[2 * k + 2]);
				return merge(vl, vr);
			}
		}

	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}