#include using namespace std; const int N = 1e5 + 5; typedef long long ll; struct BIT { int N; vector tr; BIT(int len) { N = len; tr.assign(len + 5, 0); } int lowbit(int x) { return x & -x; } void add(int x, ll v) { for (int i = x; i <= N; i += lowbit(i)) tr[i] += v; } ll sum(int x) { ll ret = 0; for (int i = x; i; i -= lowbit(i)) ret += tr[i]; return ret; } }; typedef pair pii; int n, w; ll h; int a[N], b[N], x[N]; int main(){ cin >> n >> w >> h; for (int i = 1; i <= n; i++) cin >> a[i] >> b[i] >> x[i]; vector > add(w + 5); for (int i = 1; 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])); } ll A = 0, B = 0; BIT bit(n); for (int i = 1; i <= w; i++) { for (auto P: add[i]) bit.add(P.first, P.second); int l = 0, r = n + 1; while (r - l > 1) { int mid = (r + l) / 2; if (bit.sum(mid) >= h) r = mid; else l = mid; } if (r != n + 1) { if (r % 2 == 1) A++; else B++; } } if (A > B) puts("A"); else if (A < B) puts("B"); else puts("DRAW"); cout << A << ' ' << B << endl; return 0; }