#include using namespace std; #define endl '\n' typedef long long ll; const int N = 1e5 + 10; ll n, w, h; struct Node { ll id, val; }; vector vec[N]; struct Fenwick { vector bit; inline Fenwick(ll n) : bit(n + 10) {} inline ll lowbit(ll x) { return x & (-x); } inline void add(ll x, ll k) { x++; for (ll i = x; i < bit.size(); i += lowbit(i)) bit[i] += k; } inline ll query(ll x) { x++; ll ans = 0; for (ll i = x; i; i -= lowbit(i)) ans += bit[i]; return ans; } } t(N); int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); ll a = 0, b = 0; cin >> n >> w >> h; for (ll i = 1; i <= n; i++) { ll a, b, x; cin >> a >> b >> x; vec[x].push_back({i, b}); vec[x + a].push_back({i, -b}); } for (ll i = 1; i <= w; i++) { for (auto Info : vec[i]) t.add(Info.id, Info.val); ll l = 1, r = n, ans = -1; while (r >= l) { ll mid = (l + r) >> 1; if (t.query(mid) >= h) ans = mid, r = mid - 1; else l = mid + 1; } if (ans != -1) (ans & 1 ? a++ : b++); } if (a > b) cout << 'A' << endl; else if (a < b) cout << 'B' << endl; else cout << "DRAW" << endl; return 0; }