#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;

typedef long long int ll;
using ii= pair<ll,ll>;
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define all(o) (o).begin(),(o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000001
#define mod 1000000007

class prioritize{
    public: bool operator() (ii &p1,ii &p2){
        return p1.F<p2.F;
    }
};

auto start_time= high_resolution_clock::now();
void time()
{
    #ifndef ONLINE_JUDGE
        auto stop_time= high_resolution_clock::now();
        auto duration= duration_cast<milliseconds>(stop_time-start_time);
        cout<<"run time: "<<duration.count()<<" ms"<<"\n";
    #endif
    return;
}

void ojudge()
{
	#ifndef ONLINE_JUDGE
        freopen("input1.txt","r", stdin);
        freopen("output1.txt","w",stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    return;
}

const int N= 2010;
ll dp[N][N][2];
ll mat[N][N];ll h,w;

ll rec(ll i,ll j,ll turn){

	if(i<1||i>h||j<1||j>w) return 0;
	if(i==h && j==w) return 0;
	if(dp[i][j][turn]!=-1) return dp[i][j][turn];

	if(turn==0){
		ll ans= -1e9;
		if(i+1<=h) ans= max(ans,mat[i+1][j]-rec(i+1,j,1));
		if(j+1<=w) ans= max(ans,mat[i][j+1]-rec(i,j+1,1));
		return dp[i][j][turn]= ans;
	}
	else{
		ll ans= -1e9;
		if(i+1<=h) ans= max(ans,mat[i+1][j]-rec(i+1,j,0));
		if(j+1<=w) ans= max(ans,mat[i][j+1]-rec(i,j+1,0));
		return dp[i][j][turn]= ans;
	}
}


int main()
{
    ojudge();
    
    
    cin>>h>>w;

    map<char,ll> mp;
    mp['+']= 1,mp['-']= -1;
    memset(dp,-1,sizeof(dp));

    fr(i,1,h+1){
    	fr(j,1,w+1){
    		char x;cin>>x;
    		mat[i][j]= mp[x];
    	}
    }

    ll v1= rec(1,1,0);
    if(v1>0) cout<<"Takahashi\n";
    else if(v1<0) cout<<"Aoki\n";
    else cout<<"Draw\n";


    time();
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main(){

	int N, M,T;
	cin >> N >> M>>T;

  	int Nmax = N;
	vector<int> A(M);
	vector<int> B(M);

	for(int i = 0; i < M;i++){
		int x = 0;
		int y = 0;
		cin >> x >> y;
		A.at(i) = x;
		B.at(i) = y;
	}

	bool flag = true;

	for(int i = 0; i < M; i++){
      if(i == 0) N -= A.at(i);
      else	N -= (A.at(i) - B.at(i-1));
		if(N <= 0){
			flag = false;
			break;
		}
		N += (B.at(i)-A.at(i));
      	if(N > Nmax){
          N = Nmax;
        }
	}
    
  	N -= (T - B.at(M-1));
  
	if(N <= 0){
			flag = false;
		}
  
	if(flag){
		cout << "Yes" << endl;
	}

	if(flag == false)	cout << "No" <<endl;
}