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
#include <vector>
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/time.h>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <set>

#define FOR(i,a,b)  for(__typeof(b) i=(a);i<(b);++i)
#define REP(i,a)    FOR(i,0,a)
#define FOREACH(x,c)   for(__typeof(c.begin()) x=c.begin();x != c.end(); x++)
#define ALL(c)      c.begin(),c.end()
#define CLEAR(c)    memset(c,0,sizeof(c))
#define SIZE(c) (int) ((c).size())

#define PB          push_back
#define MP          make_pair
#define X           first
#define Y           second

#define ULL         unsigned long long
#define LL          long long
#define LD          long double
#define II         pair<int, int>
#define DD         pair<double, double>

#define VC	    vector
#define VI          VC<int>
#define VVI         VC<VI>
#define VD          VC<double>
#define VS          VC<string>
#define VII         VC<II>
#define VDD         VC<DD>

#define DB(a)       cerr << #a << ": " << a << endl;

using namespace std;

template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";}
template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); }
VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {if (np != p) all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;}

#define III tuple<int,int,int>

int n, z;
vector<III> mon1;
vector<III> mon2;

void readData(){
    scanf("%d%d",&n,&z);
    mon1.reserve(n);
    mon2.reserve(n);
    int d,a;
    REP(i,n){
        scanf("%d%d",&d,&a);
        if (d < a)
            mon1.PB(make_tuple(d,a,i+1));
        else
            mon2.PB(make_tuple(d,a,i+1));
    }
}

void solve(){
    sort(ALL(mon1));
    sort(ALL(mon2),[](const III &p, const III &q){ return (get<1>(p) > get<1>(q));});
    mon1.insert(mon1.end(),ALL(mon2));

    LL h = z;
    for(auto m : mon1){
        z -= get<0>(m);
        if (z <= 0){ printf("NIE\n"); return;}
        z += get<1>(m);
    }

    printf("TAK\n");
    REP(i,n-1)
        printf("%d ", get<2>(mon1[i]));
    printf("%d\n", get<2>(mon1[n-1]));
}

int main(int argc, char *argv[]){
    readData();
    solve();
    return 0;
}