#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll B; cin >> B;
  ll C; cin >> C;

  ll ans = 0;
  if (C == 1) {
    if (B == 0) ans = 1;
    else ans = 2;
    cout << ans << '\n';
    return 0;
  }

  if (B > 0) {
    bool zero = false;
    ll pr = B + (C - 2) / 2;
    ll pl = B - C / 2;
    if (pl <= 0) zero = true;
    pl = max(pl - 1, 0ll);
    ans += (pr - pl);

    ll nr = B + (C - 1) / 2;
    ll nl = B - (C - 1) / 2;
    if (nl <= 0) zero = true;
    nl = max(nl - 1, 0ll);
    ans += (nr - nl);
    if (zero) ans++;
  } else if (B < 0) {
    bool zero = false;
    B = -B;
    ll pr = B + (C - 1) / 2;
    ll pl = B - (C - 1) / 2;
    if (pl <= 0) zero = true;
    pl = max(pl - 1, 0ll);
    ans += (pr - pl);

    ll nr = B + C / 2;
    ll nl = B - (C - 2) / 2;
    if (nl <= 0) zero = true;
    nl = max(nl - 1, 0ll);
    ans += (nr - nl);
    if (zero) ans++;
  } else {
    ll nr = C / 2;
    ll pr = (C - 1) / 2;
    ans = nr + pr + 1;
  }
  cout << ans << '\n';
  return 0;
}



#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
typedef pair<int, int> P;
// typedef modint1000000007 mint;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
const int INF = 1e9;
const ll LINF = 1e18;
const int MAX = 100010;

void solve() {
    int h, w;
    cin >> h >> w;
    VV<int> G(h + 1, V<int>(w + 1));
    rep(i, h) rep(j, w) {
        char c;
        cin >> c;
        G[i][j] = c == '+' ? 1 : -1;
    }
    VV<int> dp(h + 1, V<int>(w + 1, INF));
    dp[h - 1][w - 1] = 0;
    rrep(i, h) rrep(j, w) {
        if (i == h - 1 && j == w - 1) continue;
        dp[i][j] = G[i + 1][j] - dp[i + 1][j];
        chmax(dp[i][j], G[i][j + 1] - dp[i][j + 1]);
    }
    string ans = "Draw";
    if (dp[0][0] > 0) ans = "Takahashi";
    if (dp[0][0] < 0) ans = "Aoki";
    cout << ans << "\n";
}

int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "Yes" : "No") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}
