#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
  int i;
  for (i = 0; i < rep; i++) p[i] = val;
}
signed long long GETi() {
  signed long long i;
  scanf("%lld", &i);
  return i;
}
int A[4], B[4];
int W[4];
void solve() {
  int f, i, j, k, l, x, y;
  for (i = 0; i < 4; i++) cin >> A[i] >> B[i];
  if ((B[0] > A[3]) + (A[1] > B[2]) == 2) W[0] = 1;
  if ((B[0] < A[3]) + (A[1] < B[2]) == 2) W[0] = -1;
  if ((B[0] > A[2]) + (A[1] > B[3]) == 2) W[1] = 1;
  if ((B[0] < A[2]) + (A[1] < B[3]) == 2) W[1] = -1;
  if ((B[1] > A[3]) + (A[0] > B[2]) == 2) W[2] = 1;
  if ((B[1] < A[3]) + (A[0] < B[2]) == 2) W[2] = -1;
  if ((B[1] > A[2]) + (A[0] > B[3]) == 2) W[3] = 1;
  if ((B[1] < A[2]) + (A[0] < B[3]) == 2) W[3] = -1;
  x = max(min(W[0], W[1]), min(W[2], W[3]));
  if (x == 1) (void)printf("Team 1\n");
  if (x == -1) (void)printf("Team 2\n");
  if (x == 0) (void)printf("Draw\n");
}
int main(int argc, char** argv) {
  string s;
  if (argc == 1) ios::sync_with_stdio(false);
  for (int i = 1; i < argc; i++) s += argv[i], s += '\n';
  for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin);
  solve();
  return 0;
}
