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
//Tadrion
#include <cstdio>
#include <vector>
#include <iostream>
#include <deque>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <utility>
using namespace std;
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define CLEAR(x) (memset(x,0,sizeof(x)))
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define VAR(v, n) __typeof(n) v = (n)
#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 FOREACH(i, c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define DBG(v) cout<<#v<<" = "<<v<<endl;
#define IN(x,y) ((y).find(x)!=(y).end())
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

int n,m;
vector<pair<int, PII> > v;
int a,b,c;
vector<PII> na,poza;

int maxx = 0;
int main() {
    scanf("%d %d",&n,&m);
    FOR(i,1,n)
    {
        scanf("%d %d %d",&a,&b,&c);
        maxx = MAX(maxx,b);
        v.PB(MP(a,MP(b-a-c,c)));
    }
    sort(v.begin(),v.end());

    int cur = 0;
    /*
    while(cur < SZ(v) && v[cur].ST == 0)
    {
        ac.PB(v[cur].ND);
        cur++;
    }
    */
    //sort(ac.begin(),ac.end());
    int ok =1;
    int time = 0;
    do
    {
        vector<PII> q;
        while(cur < SZ(v) && v[cur].ST == time)
        {
            q.PB(v[cur].ND);
            cur++;
        }
        vector<PII> r(SZ(q)+SZ(na));
        vector<PII> r2(SZ(poza)+SZ(q)+SZ(na));

        std::merge(q.begin(),q.end(),na.begin(),na.end(),r.begin());
        std::merge(poza.begin(),poza.end(),r.begin(),r.end(),r2.begin());

        na.clear(); poza.clear();
        REP(i,SZ(r2))
            if(SZ(na) < m){
                if(r2[i].ND > 0)
                    na.PB(MP(r2[i].ST,r2[i].ND-1));
            }
            else
            {
                if(r2[i].ST > 0)
                    poza.PB(MP(r2[i].ST-1,r2[i].ND));
                else
                {
                    ok=0;
                    goto DAVIE;
                }
            }

        time++;
        }while(SZ(na) > 0 || cur < SZ(v));

DAVIE:

    if(ok)
        printf("TAK\n");
    else
        printf("NIE\n");

    return 0;
}