#include<bits/stdc++.h>
using namespace std;
int h,w,g[3000][3000],f[3000][3000],u[3000][3000];
int T(int x,int y){
	return ((x+y)%2)==1;
}
int dfs(int x,int y){
	if(u[x][y]){
		return f[x][y];
	}
	u[x][y]=1;
	if(x+1>h){
		f[x][y]=dfs(x,y+1)+g[x][y];
	}else if(y+1>w){
		f[x][y]=dfs(x+1,y)+g[x][y];
	}else{
		if(T(x,y)){
			//Turn of Aoki
			f[x][y]=min(dfs(x+1,y),dfs(x,y+1))+g[x][y];
		}else{
			//Turn of Takahashi
			f[x][y]=max(dfs(x+1,y),dfs(x,y+1))+g[x][y];
		}
	}
	return f[x][y];
}
int main(){
	cin>>h>>w;
	for(int i=1;i<=h;i++){
		string s;
		cin>>s;
		for(int j=1;j<=w;j++){
			if(s[j-1]=='+')g[i][j]=1;
			else g[i][j]=-1;
			if(!T(i,j))g[i][j]*=-1;
		}
	}
	u[h][w]=1;
	f[h][w]=g[h][w];
	int ans=dfs(1,1)-g[1][1];
	if(ans==0)puts("Draw");
	if(ans>0)puts("Takahashi");
	if(ans<0)puts("Aoki");
}
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << s << " = " << x << "\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << s.substr(0, i) << " = " << x << " | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int h, w;
    cin >> h >> w;
    vector<string> grid(h);
    for (int i=0; i<h; i++)
        cin >> grid[i];

    auto get = [&] (int r, int c) -> int {
        return grid[r][c] == '+' ? 1 : -1;
    };

    vector<vector<vector<int>>> dp(h, vector<vector<int>>(w, vector<int>(2)));
    for (int i=h-1; i>=0; i--)
        for (int j=w-1; j>=0; j--) {
            if (i == h - 1 && j == w - 1) continue;
            dp[i][j][0] = max(i + 1 < h ? dp[i+1][j][1] + get(i + 1, j) : -1e9, j + 1 < w ? dp[i][j+1][1] + get(i, j + 1) : -1e9);
            dp[i][j][1] = min(i + 1 < h ? dp[i+1][j][0] - get(i + 1, j) : 1e9, j + 1 < w ? dp[i][j+1][0] - get(i, j + 1) : 1e9);
        }

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

    return 0;
}
