#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

int main(){
    int n; cin >> n;
    string s,x; cin >> s >> x;
    vl b(n+1,0);
    b[n] = 1;
    ll now = 1;
    for(int i=n-1; i>=0; i--){
        int c = s[i] - '0';
        if(x[i] == 'T'){
            b[i] = b[i+1];
            rep(j,7){
                if(b[i+1]>>((j+c*now)%7) & 1) b[i] |= 1<<j;
            }
        }else{
            rep(j,7){
                if((b[i+1]>>j & 1) && (b[i+1]>>((j+c*now)%7) & 1)){
                    b[i] |= 1<<j;
                }
            }
        }
        now = now * 10 % 7;
    }
    if(b[0] & 1) cout << "Takahashi\n";
    else cout << "Aoki\n";
}
/*  
*/
#include <bits/stdc++.h>
using namespace std;

#define rng(x) x.begin(), x.end()
#define pb push_back
#define ff first
#define ss second

typedef double db;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<bool> vb;
typedef unsigned long long int lld;

/*-----------------------------Code begins----------------------------------*/
ll mod = 1e9 + 7;

void solve(){
    int n,m; cin>>n>>m;
    int a[n][m] ;
    int dp[n][m] ;
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            char c;  cin>>c;
            if(c=='-'){a[i][j]=-1;}
            else{a[i][j]=1;}
        }
    }
    dp[n-1][m-1]=0;
    for(int i=n-1; i>=0; i--){
        for(int j=m-1; j>=0; j--){
            if(i<(n-1) && j<(m-1)){
                dp[i][j] = max(a[i][j+1] - dp[i][j+1] , a[i+1][j] - dp[i+1][j]);
            }
            else if(i<(n-1)){
                dp[i][j] = a[i+1][j] - dp[i+1][j];
            }
            else if(j<(m-1)){
                dp[i][j] = a[i][j+1] - dp[i][j+1];
            }
        }
    }
    if(dp[0][0]==0){
        cout<<"Draw\n";
    }
    else if(dp[0][0]>0){
        cout<<"Takahashi\n";
    }
    else{
        cout<<"Aoki\n";
    }
}
int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  //cin >> T;
  while (T--){
    solve();
  }
  return 0;
}
