import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


void add(long[] bit, int pos, long val) {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

int N, W;
long H;
int[] A, X;
long[] B;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      W = readInt();
      H = readLong();
      A = new int[N];
      B = new long[N];
      X = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
        B[i] = readLong();
        X[i] = readInt() - 1;
      }
      
      auto events = new Tuple!(int, int)[][W + 1];
      foreach (i; 0 .. N) {
        events[X[i]] ~= tuple(i, +1);
        events[X[i] + A[i]] ~= tuple(i, -1);
      }
      
      int[2] ans;
      int bitN;
      for (bitN = 1; bitN < N; bitN <<= 1) {}
      auto bit = new long[bitN];
      foreach (x; 0 .. W) {
        foreach (e; events[x]) {
          bit.add(e[0], e[1] * B[e[0]]);
        }
        // i s.t. (sum of [0, i)) < H <= (sum of [0, i + 1))
        long target = H;
        int lo = 0, hi = bitN;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          if (bit[mid - 1] < target) {
            lo = mid;
            target -= bit[mid - 1];
          } else {
            hi = mid;
          }
        }
        debug {
          writeln(x, " ", lo);
        }
        ++ans[lo % 2];
      }
      writeln((ans[0] > ans[1]) ? "A" : (ans[0] < ans[1]) ? "B" : "DRAW");
    }
  } catch (EOFException e) {
  }
}