#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll op1(ll a, ll b) { return max(a, b); }

ll e1() { return 0LL; }

ll mapping1(ll f, ll x) { return max(f, x); }

ll composition1(ll f, ll g) { return max(f, g); }

ll id1() { return 0LL; }

struct S {
    ll val;
    ll size;
};

S op2(S a, S b) { return S{a.val + b.val, a.size + b.size}; }

S e2() { return S{0, 0}; }

ll INF = 10000000000023;

S mapping2(ll f, S x) {
    if (f != INF) {
        x.val = f * x.size;
    }
    return x;
}

ll composition2(ll f, ll g) {
    if (f == INF) {
        return g;
    }
    return f;
}

ll id2() { return INF; }

int main() {
    ll n, w, h;
    cin >> n >> w >> h;
    vector<ll> a(n);
    vector<ll> b(n);
    vector<ll> x(n);
    for (ll i = 0; i < n; i++) {
        cin >> a[i] >> b[i] >> x[i];
        a[i]--;
    }
    // 最大値を管理するセグ木
    lazy_segtree<ll, op1, e1, ll, mapping1, composition1, id1> seg1(w);
    lazy_segtree<S, op2, e2, ll, mapping2, composition2, id2> seg2(w);
    for (ll i = 0; i < w; i++) {
        seg2.set(i, S{0, 1});
    }
    ll a_pt = 0;
    ll b_pt = 0;

    for (ll i = 0; i < n; i++) {
        ll max_val = seg1.prod(a[i], a[i] + x[i]);
        seg1.apply(a[i], a[i] + x[i], max_val + b[i]);

        if (max_val + b[i] >= h) {
            ll sums = seg2.prod(a[i], a[i] + x[i]).val;
            if (i % 2 == 0) {
                a_pt += (x[i] - sums);
            } else {
                b_pt += (x[i] - sums);
            }
            seg2.apply(a[i], a[i] + x[i], 1);
        }
    }
    if (a_pt == b_pt) {
        cout << "DRAW" << endl;
    } else if (a_pt > b_pt) {
        cout << "A" << endl;
    } else {
        cout << "B" << endl;
    }
}