#include <bits/stdc++.h>
using namespace std;
struct binary_indexed_tree{
  int N;
  vector<long long> BIT;
  binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
  }
  void add(int i, long long x){
    i++;
    while (i <= N){
      BIT[i] += x;
      i += i & -i;
    }
  }
  long long sum(int i){
    long long ans = 0;
    while (i > 0){
      ans += BIT[i];
      i -= i & -i;
    }
    return ans;
  }
};
int main(){
  int n, w;
  long long h;
  cin >> n >> w >> h;
  vector<int> a(n), b(n), x(n);
  for (int i = 0; i < n; i++){
    cin >> a[i] >> b[i] >> x[i];
    x[i]--;
  }
  vector<vector<pair<int, long long>>> add(w + 1);
  for (int i = 0; i < n; i++){
    add[x[i]].push_back(make_pair(i, b[i]));
    add[x[i] + a[i]].push_back(make_pair(i, -b[i]));
  }
  long long A = 0, B = 0;
  binary_indexed_tree BIT(n);
  for (int i = 0; i < w; i++){
    for (auto P : add[i]){
      BIT.add(P.first, P.second);
    }
    int tv = n + 1, fv = 0;
    while (tv - fv > 1){
      int mid = (tv + fv) / 2;
      if (BIT.sum(mid) >= h){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    if (tv != n + 1){
      if (tv % 2 == 1){
        A++;
      } else {
        B++;
      }
    }
  }
  if (A > B){
    cout << 'A' << endl;
  } else if (A < B){
    cout << 'B' << endl;
  } else {
    cout << "DRAW" << endl;
  }
}