#include<bits/stdc++.h>

#define RG register

using namespace std;

typedef long long ll;

const int MAXN = ;

struct segment_tree {

        ll lmax, rmax, ans, sum;

} sgt[MAXN << ];

int n, m;

ll k, d;

inline void pushup(int x) {

        sgt[x].sum = sgt[x << ].sum + sgt[x <<  | ].sum;

        sgt[x].lmax = max(sgt[x << ].lmax, sgt[x << ].sum + sgt[x <<  | ].lmax);

        sgt[x].rmax = max(sgt[x <<  | ].rmax, sgt[x << ].rmax + sgt[x <<  | ].sum);

        sgt[x].ans = max(sgt[x << ].ans, max(sgt[x <<  | ].ans, sgt[x << ].rmax + sgt[x <<  | ].lmax));

}

void build(int x, int l, int r) {

        if (l == r) {

                sgt[x].lmax = sgt[x].rmax = ;

                sgt[x].sum = sgt[x].ans = -k;

                return ;

        }

        int mid = (l + r) >> ;

        build(x << , l, mid);

        build(x <<  | , mid + , r);

        pushup(x);

}

void update(int x, int l, int r, int aim, ll add) {

        if (l == r) {

                sgt[x].sum += add, sgt[x].ans += add;

                sgt[x].lmax = sgt[x].rmax = max(sgt[x].sum, 0LL);

                return ;

        }

        int mid = (l + r) >> ;

        if (aim <= mid) {

                update(x << , l, mid, aim, add);

        } else {

                update(x <<  | , mid + , r, aim, add);

        }

        pushup(x);

}

int main() {

        ll x, y;

        scanf("%d %d %lld %lld", &n, &m, &k, &d);

        build(, , n);

        for (int i = ; i <= m; i++) {

                scanf("%lld %lld", &x, &y);

                update(, , n, x, y);

                if (sgt[].ans <= 1LL * k * d) {

                        printf("TAK\n");

                } else {

                        printf("NIE\n");

                }

        }

        return ;

}