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


void main() {
    auto s = readln.split;
    auto N = s[0].to!int;
    auto W = s[1].to!int;
    auto H = s[2].to!long;

    auto A = new int[](N);
    auto B = new long[](N);
    auto X = new int[](N);

    foreach (i; 0..N) {
        s = readln.split;
        A[i] = s[0].to!int;
        B[i] = s[1].to!long;
        X[i] = s[2].to!int - 1;
    }


    auto ans = new int[](W);
    Tuple!(int, int, int)[][int] middles;
    
    foreach (i; 0..W)
        middles[N/2] ~= tuple(i, 0, N);
    

    for (int settled = 0; settled < W; ) {
        BIT height = new BIT(W+10);
        
        foreach (i; 0..N) {
            height.add(X[i], X[i]+A[i], B[i]);
            
            while (i in middles && !middles[i].empty) {
                auto col = middles[i].back[0];
                auto lo = middles[i].back[1];
                auto hi = middles[i].back[2];
                middles[i].popBack;

                if (hi - lo <= 1) {
                    settled += 1;
                    int win;
                    if (height.sum(0, col+1) >= H) win = i % 2;
                    else win = 1 - i % 2;
                    ans[col] = win ? 1 : -1;
                } else {
                    if (height.sum(0, col+1) >= H) hi = (hi + lo) / 2;
                    else lo = (hi + lo) / 2;
                    middles[(hi+lo)/2] ~= tuple(col, lo, hi);
                }
            }
        }
    }


    if (ans.sum > 0) writeln("B");
    else if (ans.sum == 0) writeln("DRAW");
    else writeln("A");
}


class BIT{
    int n;
    long[] table;

    this(int n){
        this.n = n;
        table = new long[](n+1);
    }

    void add(int i, long x){
        i++;
        while (i <= n){
            table[i] += x;
            i += i & -i;
        }
    }
    
    // [l, r)
    void add(int l, int r, long x) {
        add(l, x);
        add(r, -x);
    }

    // [0, i]
    int sum(int i){
        i++;
        int ret = 0;
        while (i > 0){
            ret += table[i];
            i -= i & -i;
        }
        return ret;
    }

    // [l, r)
    int sum(int l, int r){
        if (l >= r) return 0;
        return sum(r-1) - sum(l-1);
    }
}