#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <utility>
#include <algorithm>
using namespace std;
using ll = long long;

bool localTest = false;

long long readLongLong()
{
    long long t;
    cin >> t;
    return t;
}

std::vector<ll> readVector(long long size)
{
    std::vector<ll> v(size);
    for (long long i = 0; i < size; i++)
    {
        cin >> v[i];
    }
    return v;
}

class CodeForcesPrint
{
public:
CodeForcesPrint operator<<(string x)
    {
        CodeForcesPrint tmp;
        std::cout << x << std::endl;
        return tmp;
    }
    CodeForcesPrint operator<<(long long x)
    {
        CodeForcesPrint tmp;
        std::cout << x << std::endl;
        return tmp;
    }
    CodeForcesPrint operator<<(std::vector<std::vector<long long>> finalAnswer)
    {
        CodeForcesPrint tmp;
        if (localTest)
        {
            cout << "--final answer--" << endl;
        }
        for (long long i = 0; i < finalAnswer.size(); i++)
        {
            for (long long k = 0; k < finalAnswer.at(i).size(); k++)
            {
                cout << finalAnswer.at(i).at(k) << " ";
            }
            cout << endl;
        }
        return tmp;
    }
    CodeForcesPrint operator<<(std::vector<string> finalAnswer)
    {
        CodeForcesPrint tmp;
        if (localTest)
        {
            cout << "--final answer--" << endl;
        }
        for (long long i = 0; i < finalAnswer.size(); i++)
        {
            cout << finalAnswer[i] << endl;
        }
        return tmp;
    }
    CodeForcesPrint operator<<(std::vector<long long> v)
    {
        CodeForcesPrint tmp;
        for (long long i = 0; i < v.size(); i++)
        {
            cout << v[i] << " ";
        }
        cout << endl;
        return tmp;
    }
};

long long readTestcaseSize()
{
    ll t;
    cin >> t;
    return t;
}

#define inTest                 \
    ll t = readTestcaseSize(); \
    for (ll testcase = 0; testcase < t; testcase++)

class OddNumber
{
};

class EvenNumber
{
};

bool operator==(OddNumber oddNumber, long long n)
{
    return n % 2 == 1;
}

bool operator==(EvenNumber evenNumber, long long n)
{
    return n % 2 == 0;
}

bool operator==(long long n, OddNumber oddNumber)
{
    return oddNumber == n;
}

bool operator==(long long n, EvenNumber evenNumber)
{
    return evenNumber == n;
}

template <class T, class U>
std::vector<U> permutation(std::vector<T> vec, std::vector<T> before_list, std::vector<U> after_list)
{
    std::vector<U> res(vec.size());
    for (ll i = 0; i < vec.size(); i++)
    {
        for (ll k = 0; k < before_list.size(); k++)
        {
            if (vec[i] == before_list[k])
            {
                res[i] = after_list[k];
            }
        }
    }
    return res;
}

template <class T, class U>
vector<U> permutationRead(long long size, std::vector<T> before_list, std::vector<U> after_list)
{
    vector<T> t(size);
    for (ll i = 0; i < size; i++)
    {
        cin >> t[i];
    }
    return permutation<T, U>(t, before_list, after_list);
}

#define ll(name) long long name = readLongLong()
#define llV(name, size) std::vector<long long> name = readVector(size)

OddNumber Odd;
EvenNumber Even;
CodeForcesPrint print;

//________________________________________________________________________________

#define INF (1ll) << 60
#define rep(i, n) for (long long i = 0; i < n; i++)
#define yes print<<"Yes"
#define no print<<"No"
#define all(v) v.begin(),v.end()
#define ld long double

int main()
{
    ll A,B,C;cin>>A>>B>>C;
    if(A*A+B*B<C*C){
        yes;
    }else{
        no;
    }
}
#include <iostream>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;




int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	vector<vector<char>> mat;
	cin >> n >> m;
	mat.resize(n + 1, vector<char>(m + 1));
	for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> mat[i][j];

	// vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(m + 1, vector<int>(2)));
	const int inf = 1e9;
	vector<vector<int>> dp(n + 1, vector<int>(m + 1, -inf));

	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] = 0;
			else if (j == m - 1) dp[i][j] = ((mat[i + 1][j] == '+') ? 1 : -1) - dp[i + 1][j];
			else if (i == n - 1) dp[i][j] = ((mat[i][j + 1] == '+') ? 1 : -1) - dp[i][j + 1];
			else {
				int v1 = ((mat[i + 1][j] == '+') ? 1 : -1) - dp[i + 1][j];
				int v2 = ((mat[i][j + 1] == '+') ? 1 : -1) - dp[i][j + 1];
				dp[i][j] = max(v1, v2);
			}
		}
	}

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


	return 0;
}