#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#ifdef NDEBUG
  #define assert(e) if(!(e)){stod("");}
#endif
#ifdef ONLINE_JUDGE
  #define debug(x)
  #define debug2(x,y)
  #define debug3(x,y,z)
#else
  #define debug(x) std::cerr<<#x<<": "<<x<<"\n"
  #define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
  #define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
#endif

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

void solve() {
  int h, w;
  scan(h, w);
  vvi grid(h, vi(w, -1));
  string s;
  rep (i, h) {
    scan(s);
    rep (j, w) {
      if (s[j] == '+') {
        grid[i][j] = 1;
      }
    }
  }
  debug(grid);
  vvi dp(h, vi(w, 0));
  for (int i = h - 2; i >= 0; --i) {
    dp[i][w - 1] = grid[i + 1][w - 1] - dp[i + 1][w - 1];
  }
  for (int j = w - 2; j >= 0; --j) {
    dp[h - 1][j] = grid[h - 1][j + 1] - dp[h - 1][j + 1];
  }
  for (int i = h - 2; i >= 0; --i) {
    for (int j = w - 2; j >= 0; --j) {
      int cand1 = grid[i][j + 1] - dp[i][j + 1];
      int cand2 = grid[i + 1][j] - dp[i + 1][j];
      dp[i][j] = max(cand1, cand2);
    }
  }
  if (dp[0][0] > 0) {
    print("Takahashi");
  } else if (dp[0][0] < 0) {
    print("Aoki");
  } else {
    print("Draw");
  }
}

int main() {
  solve();
  return 0;
}

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
// cout << fixed << setprecision(桁数);

int main(){
    int H, W;
    cin >> H >> W;
    vector<vector<int>> A(2010, vector<int>(2010, 0)), dp(2010, vector<int>(2010, 0));
    rep(i, H){
        rep(j, W){
            char c;
            cin >> c;
            int tmp = 0;
            if(c == '+')
                tmp = 1;

            if ((i + j + tmp) % 2 == 0){
                A[i][j] = 1;
            } else {
                A[i][j] = -1;
            }
        }
    }

    dp[H - 1][W - 1] = 0;

    for (int i = H - 2; i >= 0; i--){
        dp[i][W - 1] = dp[i + 1][W - 1] + A[i + 1][W - 1];
    }
    for (int j = W - 2; j >= 0; j--)
    {
        dp[H - 1][j] = dp[H - 1][j + 1] + A[H - 1][j + 1];
    }

    for (int a = H + W - 4; a >= 0; a--){
        for (int i = 0; i < H - 1; i++){
            int j = a - i;
            if (0 <= j && j < W - 1)
            {
                if (a % 2 == 0){
                    dp[i][j] = max(dp[i][j + 1] + A[i][j + 1], dp[i + 1][j] + A[i + 1][j]);
                } else {
                    dp[i][j] = min(dp[i][j + 1] + A[i][j + 1], dp[i + 1][j] + A[i + 1][j]);
                }
            }
        }
    }

    if(dp[0][0] > 0)
        cout << "Takahashi" << endl;
    else if (dp[0][0] < 0)
        cout << "Aoki" << endl;
    else
        cout << "Draw" << endl;
}