//#include "test.hpp"
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); 
#define ll long long 
#define pre(a,b) cout<<fixed<<setprecision(a)<<b<<"\n";//a for precision b for answer
#define mp make_pair
#define pb push_back 
#define forn(n) for(ll i=0;i<n;i++) 
#define ff first
#define ss second
#define MAX 1e18
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound
const double pi =  3.141592653589793238;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
const int N=3e5+5;
//cout<<"Case #"<<p<<": "<<;
//file input  freopen("input.txt","r",stdin); 
//file output freopen("output.txt","w",stdout);
 
using namespace std;


//check edge cases, alternate methods, n==1,
//check MOD1,MOD2,
//stuck?? - try simplifying expression, try reversing the problem,  


int32_t main()
{
  IOS;
  ll a,b,c;
  cin>>a>>b>>c;
  (a+c>b)?cout<<"Takahashi":cout<<"Aoki";
}
#include <iostream>
#include <algorithm>
using namespace std;

main()
{
    string tak = "Takahashi";
    string aok = "Aoki";
     int a, b, c;
     cin >> a >> b >> c;
     if(c == 0){
        while(true)
        {
            if(a <= 0){cout << aok;return 0;}
            a--;
            if(b <= 0){cout << tak; return 0;}
            b--;
        }
     }else {
         while(true)
        {
            if(b <= 0){cout << tak; return 0;}
            b--;
            if(a <= 0){cout << aok;return 0;}
            a--;
        }
     }
}