#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double

int main() {
    int H, W;
    cin >> H >> W;
    vector<vector<int>> grid(H, vector<int>(W));
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            char c;
            cin >> c;
            if (c == '+') grid[i][j] = 1;
            else grid[i][j] = -1;
        }
    }
    vector<vector<int>> dp(H, vector<int>(W, 0));
    for (int i = H-1; i >= 0; i--) {
        for (int j = W-1; j >= 0; j--) {
            if (i == H-1 && j == W-1) continue;
            if ((i+j)%2 == 0) {
                dp[i][j] = -1e9;
                if (i < H-1) dp[i][j] = max(dp[i][j], dp[i+1][j]+grid[i+1][j]);
                if (j < W-1) dp[i][j] = max(dp[i][j], dp[i][j+1]+grid[i][j+1]);
            }
            if ((i+j)%2 == 1) {
                dp[i][j] = 1e9;
                if (i < H-1) dp[i][j] = min(dp[i][j], dp[i+1][j]-grid[i+1][j]);
                if (j < W-1) dp[i][j] = min(dp[i][j], dp[i][j+1]-grid[i][j+1]);
            }
        }
    }
    if (dp[0][0] > 0) cout << "Takahashi\n";
    else if (dp[0][0] == 0) cout << "Draw\n";
    else cout << "Aoki\n";
    return 0;
}
#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 1e18;
const ll fact_table = 3200008;

priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/

#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)
#define all(c) begin(c), end(c)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll m = mod) {
    ll x = 1;
    while (b) {
        while (!(b & 1)) {
            (a *= a) %= m;
            b >>= 1;
        }
        (x *= a) %= m;
        b--;
    }
    return x;
}
vec rv(ll read) {
    vec res(read);
    for (int i = 0; i < read; i++) {
        cin >> res[i];
    }
    return res;
}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
*/
bool icpc = false;
bool multicase = false;

ll n, m, k, q;
string s;
ll dp[1050000];
vector<P> ban[20];

bool solve() {
    cin >> n >> m;
    rep(i, m) {
        int a, b, c;
        cin >> a >> b >> c;
        ban[a].pb(P(b, c));
    }
    for (int i = 1; i <= n; i++) {
        sort(all(ban[i]));
    }
    dp[0] = 1;
    ll bit = (1ll << n);
    for (ll set = 0; set < bit; set++) {
        // set -> newset (= set + (1ll << j))
        for (int j = 0; j < n; j++) {
            if ((set >> j) & 1) continue;
            ll newset = set + (1ll << j);
            ll newcnt = __builtin_popcount(newset);
            bool dame = false;
            for (auto [maxi, cnt] : ban[newcnt]) {
                ll r = 0;
                for (int k = 0; k < n; k++) {
                    if ((k < maxi) && (newset >> k) & 1ll) r++;
                }
                if (r > cnt) dame = true;
            }
            if (!dame) dp[newset] += dp[set];
        }
    }
    p(dp[(1ll << n) - 1]);
    return true;
}

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

    if (icpc) {
        while (solve())
            ;
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // cout << "Case #" << testcase << ": ";
        solve();
        testcase++;
    }

    // solve();
    return 0;
}