1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=5100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int n,m;
int M[MAX][MAX];
bool V[MAX][MAX];

bool dfs(int r, int c) {
	if(r<0||r>=n ||c<0 ||c>=m || M[r][c]==1 || V[r][c]) return false;
	if(r==n-1&&c==m-1) return true;
	V[r][c] = true;
	bool ok=false;
	ok = ok || dfs(r,c+1);
	ok = ok || dfs(r+1,c);
	return ok;
}

bool try_insert(int r,int c) {
	M[r][c] = 1;
	loop(i,0,n) loop(j,0,m) V[i][j]=0;
	if(dfs(0,0)) return true;
	M[r][c]=0;
	return false;
}

int main(){
	ios_base::sync_with_stdio(0);
	int x = 0;
	int k;
	cin>>n>>m>>k;
	int r,c,z;
	while(k--) {
		cin>>r>>c>>z;
		if(try_insert((r^x)%n,(c^x)%m)) {
			pln("NIE");
		} else {
			pln("TAK");
			x ^= z;
		}
	}
}