#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_    }
#define MY_DEBUG(s)      s
#define MY_IS_DEBUG      (true)
#else
#define MY_NAMESPACE(ns) 
#define MY_NAMESPACE_    
#define MY_DEBUG(s)
#define MY_IS_DEBUG      (false)
#endif

#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;

constexpr int IMIN = numeric_limits<int>::min();
constexpr int IMAX = numeric_limits<int>::max();
constexpr ll LLMIN = numeric_limits<ll>::min();
constexpr ll LLMAX = numeric_limits<ll>::max();

template <typename T> bool chmax(T& maxval, T const& newval) { if (newval > maxval) { maxval = newval; return true; } return false; }
template <typename T> bool chmin(T& minval, T const& newval) { if (newval < minval) { minval = newval; return true; } return false; }


MY_NAMESPACE(testbed)
int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int h, w;
	cin >> h >> w;
	vector<vector<char>> a(h, vector<char>(w));
	for (int i = 0; i < h; i++)
	{
		for (int j = 0; j < w; j++)
		{
			cin >> a[i][j];
		}
	}

	vector<vector<int>> tk(h, vector<int>(w));
	vector<vector<int>> ao(h, vector<int>(w));
	for (int i = h - 1; i >= 0; i--)
	{
		for (int j = w - 1; j >= 0; j--)
		{
			if (i == h - 1 && j == w - 1)
				continue;

			bool is_taka = ((i + j) % 2 == 0);
			// down
			int next_i = i + 1;
			int next_j = j;
			int down_value = IMIN;
			if (next_i < h && next_j < w)
			{
				down_value = tk[next_i][next_j] - ao[next_i][next_j];
				if (!is_taka)
					down_value *= -1;
				if (a[next_i][next_j] == '+')
					down_value++;
				else
					down_value--;
			}

			// right
			next_i = i;
			next_j = j + 1;
			int right_value = IMIN;
			if (next_i < h && next_j < w)
			{
				right_value = tk[next_i][next_j] - ao[next_i][next_j];
				if (!is_taka)
					right_value *= -1;
				if (a[next_i][next_j] == '+')
					right_value++;
				else
					right_value--;
			}

			if (is_taka)
			{
				if (down_value > right_value)
				{
					tk[i][j] = tk[i + 1][j] + (a[i + 1][j] == '+' ? 1 : -1);
					ao[i][j] = ao[i + 1][j];
				}
				else
				{
					tk[i][j] = tk[i][j + 1] + (a[i][j + 1] == '+' ? 1 : -1);
					ao[i][j] = ao[i][j + 1];
				}
			}
			else
			{
				if (down_value > right_value)
				{
					tk[i][j] = tk[i + 1][j];
					ao[i][j] = ao[i + 1][j] + (a[i + 1][j] == '+' ? 1 : -1);
				}
				else
				{
					tk[i][j] = tk[i][j + 1];
					ao[i][j] = ao[i][j + 1] + (a[i][j + 1] == '+' ? 1 : -1);
				}
			}
		}
	}

	string ans;
	if (tk[0][0] == ao[0][0])
		ans = "Draw";
	else if (tk[0][0] > ao[0][0])
		ans = "Takahashi";
	else
		ans = "Aoki";
	cout << ans << "\n";
	return 0;
}
MY_NAMESPACE_


/* in the name of Anton */

/*
  Compete against Yourself.
  Author - Aryan (@aryanc403)
  Atcoder library - https://atcoder.github.io/ac-library/production/document_en/
*/

#ifdef ARYANC403
    #include <header.h>
#else
    #pragma GCC optimize ("Ofast")
    #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
    #pragma GCC optimize ("-ffloat-store")
    #include<bits/stdc++.h>
    #define dbg(args...) 42;
#endif

using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define endl "\n"

typedef long long int lli;
typedef long double mytype;
typedef pair<lli,lli> ii;
typedef vector<ii> vii;
typedef vector<lli> vi;


const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403()
{
#ifdef ARYANC403
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
    cerr<<"Time Taken : "<<diff.count()<<"\n";
#endif
}

const lli INF = 0xFFFFFFFFFFFFFFFL;

lli seed;
mt19937 rng(seed=chrono::steady_clock::now().time_since_epoch().count());
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}

class CMP
{public:
bool operator()(ii a , ii b) //For min priority_queue .
{    return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y ));   }};

void add( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt==m.end())         m.insert({x,cnt});
    else                    jt->Y+=cnt;
}

void del( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt->Y<=cnt)            m.erase(jt);
    else                      jt->Y-=cnt;
}

bool cmp(const ii &a,const ii &b)
{
    return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}

const lli mod = 1000000007L;
// const lli maxN = 1000000007L;

    lli T,n,i,j,k,in,cnt,l,r,u,v,x,y;
    lli m;
    string s;
    vi a;
    //priority_queue < ii , vector < ii > , CMP > pq;// min priority_queue .

int main(void) {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // freopen("txt.in", "r", stdin);
    // freopen("txt.out", "w", stdout);
// cout<<std::fixed<<std::setprecision(35);
// cin>>T;while(T--)
{

    cin>>n>>m;
    vector<vi> a(n,vi(m,0));
    vector<vi> dp(n,vi(m,0));
    fo(i,n)
    {
        cin>>s;
        fo(j,m){
            if(s[j]=='+')
                a[i][j]=1;
            else
                a[i][j]=-1;
        }
    }
    dbg(a);
    repD(i,n-1,0)   repD(j,m-1,0){
        if(i==n-1&&j==m-1)
            continue;
        if(i==n-1){
            dp[i][j]=a[i][j+1]-dp[i][j+1];
            continue;
        }
        if(j==m-1){
            dp[i][j]=a[i+1][j]-dp[i+1][j];
            continue;
        }
        dp[i][j]=max(a[i+1][j]-dp[i+1][j],a[i][j+1]-dp[i][j+1]);
    }
    dbg(a);
    const lli ans=dp[0][0];
    if(ans==0){
        cout<<"Draw"<<endl;
        return 0;
    }
    if(ans>0){
        cout<<"Takahashi"<<endl;
        return 0;
    }
    if(ans<0){
        cout<<"Aoki"<<endl;
        return 0;
    }
}   aryanc403();
    return 0;
}
