#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int n, m, q;
int dx[8] = {1, 1, 1, 0, -1, -1, -1, 0}, dy[8] = {1, 0, -1, -1, -1, 0, 1, 1};
priority_queue<int>s1[100005], s2[100005];
priority_queue<int>s3[100005], s4[100005];
template<typename T>
inline void read(T &x) {
    char ch = getchar();
    x = 0;

    while (ch < '0' || '9' < ch)
        ch = getchar();

    while ('0' <= ch && ch <= '9')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();

    return;
}
template<typename T, typename ...L>
inline void read(T &x, L &...l) {
    read(x);
    read(l...);
    return;
}
namespace BIT1 {
int c[100005];
inline int lowbit(int x) {
    return x & (-x);
}
void update(int x, int y) {
    for (; x; x -= lowbit(x))
        c[x] = min(c[x], y);

    return;
}
int query(int x) {
    if (!x)
        return 0;

    int res = n + 1;

    for (; x <= m; x += lowbit(x))
        res = min(res, c[x]);

    return res;
}
int check(int x, int y) {
    return query(y) <= x;
}
}
namespace BIT2 {
int c[100005];
inline int lowbit(int x) {
    return x & (-x);
}
void update(int x, int y) {
    for (; x <= m; x += lowbit(x))
        c[x] = max(c[x], y);

    return;
}
int query(int x) {
    if (x == m + 1)
        return n + 1;

    int res = 0;

    for (; x; x -= lowbit(x))
        res = max(res, c[x]);

    return res;
}
int check(int x, int y) {
    return query(y) >= x;
}
}
void modify1(int x, int y) {
    int z = 0;
    BIT1::update(y, x);

    while (!s1[x - 1].empty()) {
        if (-s1[x - 1].top() <= y + 1) {
            z = -s1[x - 1].top();
            s1[x - 1].pop();
        } else
            break;
    }

    if (z)
        modify1(x - 1, z);

    z = 0;

    while (!s3[y + 1].empty()) {
        if (s3[y + 1].top() >= x - 1) {
            z = s3[y + 1].top();
            s3[y + 1].pop();
        } else
            break;
    }

    if (z)
        modify1(z, y + 1);

    return;
}
void modify2(int x, int y) {
    int z = 0;
    BIT2::update(y, x);

    while (!s2[x + 1].empty()) {
        if (s2[x + 1].top() >= y - 1) {
            z = s2[x + 1].top();
            s2[x + 1].pop();
        } else
            break;
    }

    if (z)
        modify2(x + 1, z);

    z = 0;

    while (!s4[y - 1].empty()) {
        if (-s4[y - 1].top() <= x + 1) {
            z = -s4[y - 1].top();
            s4[y - 1].pop();
        } else
            break;
    }

    if (z)
        modify2(z, y - 1);

    return;
}
int insert(int x, int y) {
    int flag1 = 0, flag2 = 0;

    for (int i = 0; i < 8; i += 1) {
        flag1 |= BIT1::check(x + dx[i], y + dy[i]);
        flag2 |= BIT2::check(x + dx[i], y + dy[i]);
    }

    if (flag1 && flag2)
        return 0;

    if (!flag1 && !flag2) {
        s1[x].push(-y);
        s3[y].push(x);
        s2[x].push(y);
        s4[y].push(-x);
    }

    if (flag1)
        modify1(x, y);

    if (flag2)
        modify2(x, y);

    return 1;
}
int main() {
    int v = 0, r, c, z, x, y;
    read(n, m, q);

    for (int i = 1; i <= m; i += 1)
        BIT1::c[i] = n + 1;

    while (q--) {
        read(r, c, z);
        x = (r ^ v) % n + 1;
        y = (c ^ v) % m + 1;

        if (BIT1::check(x, y) || BIT2::check(x, y)) {
            printf("NIE\n");
            continue;
        }

        if (insert(x, y))
            printf("NIE\n");
        else
            v ^= z, printf("TAK\n");
    }

    return 0;
}