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
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

int x;
vector<vector<int>> board;

void resize(const int n, const int m)
{
    board = vector<vector<int>>(n);
    for(int i = 0; i < n; ++i)
        board[i] = vector<int>(m);
}

bool pathExists()
{
    vector<vector<bool>> calcBoard = vector<vector<bool>>(board.size());
    for(int i = 0; i < board.size(); ++i)
        calcBoard[i] = vector<bool>(board[i].size());

    calcBoard[0][0] = true;
    for(int i = 0; i < calcBoard.size(); ++i)
    {
        for(int j = 0; j < calcBoard[i].size(); ++j)
        {
            if(i == 0 && j == 0)
                continue;

            if(board[i][j] == -1)
                continue;

            if(i > 0)
                calcBoard[i][j] = (calcBoard[i][j] || calcBoard[i-1][j]);

            if(j > 0)
                calcBoard[i][j] = (calcBoard[i][j] || calcBoard[i][j-1]);
        }
    }

    return calcBoard[calcBoard.size()-1][calcBoard[0].size()-1];
}

int main()
{
    ios_base::sync_with_stdio(0);

    int n, m, k;
    cin >> n >> m >> k;
    resize(n, m);

    while(k--)
    {
        int r, c, z;
        cin >> r >> c >> z;

        r = (r^x) % n;
        c = (c^x) % m;
        board[r][c] = -1;

        //cout << "(r,c): " << r << ' ' << c << endl;

        if(pathExists())
        {
            cout << "NIE" << endl;
            continue;
        }

        board[r][c] = 0;
        x ^= z;

        cout << "TAK" << endl;
    }

    return 0;
}