// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define pii pair<int, int>
#define fe(i, a, b) for (int i = a; i <= (b); ++i)
#define fr(i, a, b) for (int i = b; i >= (a); --i)
using namespace std;

inline int in() {
    int s = 0, f = 0, ch = getchar();
    while (!isdigit(ch))
        f |= ch == '-', ch = getchar();
    while (isdigit(ch))
        s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
    return f ? -s : s;
}
const int N = 1e6 + 5;
const int mod = 4;
const int inf = 1ULL << 60;
int n, m, k;
int a[N], b[N], f[N];
int c[N];

int qp(int a, int b) {
    int sum = 1;
    while (b) {
        if (b & 1)
            sum = sum * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return sum;
}
int inv(int a) {
    return qp(a, mod - 2);
}
bool flag[N];
int p[N], tot;

int find(int x) {
    return x == f[x] ? x : f[x] = find(f[x]);
}

struct node {
    int x, y;
    bool operator<(const node& b) const { return y > b.y; }
};

vector<pair<int, int>> g[N];
void work() {
    n = in(), m = in(), k = in();
    if (k == 0) {
        if (n - m >= 1) {
            puts("Takahashi");
        } else {
            puts("Aoki");
        }
    } else {
        if (m - n >= 1) {
            puts("Aoki");
        } else {
            puts("Takahashi");
        }
    }
}
signed main() {
#ifndef ONLINE_JUDGE
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
#endif
    // for (int _ = in(); _; --_)
    work();
    // system("pause");
    return 0;
}
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <iomanip>
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ps(x,y)   fixed<<setprecision(y)<<x
using namespace std;
void solve()
{
	int n, m, t;
	cin >> n >> m >> t;
	int tot = n, prev = 0, flag = 1;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		tot -= (a - prev);
		if (tot <= 0) {
			flag = 0;
			tot = 0;
		}
		// cout << tot << endl;
		int dif = b - a;
		tot += dif;
		if (tot > n)tot = n;
		prev = b;

	}
	tot -= (t - prev);
	if (tot <= 0)flag = 0;
	if (flag) {
		cout << "Yes\n";
	}
	else {
		cout << "No\n";
	}
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int t = 1;
	// scanf("%d", &t);
	while (t--) {
		solve();
	}

}