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
//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,z;
vector<PII > a;
vector<pair<PII,PII> > b;
int x[100010],y[100010];
vector<int> ress[3];
vector<int> res;
vector<PII> c;
set<PII> duze;
set<PII> spadki;
LL zycie;
LL verify() {
    LL zyc = z;
    REP(i,SZ(res)) {
        zyc-= (LL)x[res[i]];
       //printf("%lld %d\n",zycie,res[i]);
        if(zyc <= 0) return 0;
        zyc += (LL)y[res[i]];
    }
   // printf("%lld\n",zyc);
    return zyc;
}

int main() {
    scanf("%d %d",&n,&z);
    FOR(i,1,n) {
        scanf("%d %d",&x[i],&y[i]);
        if(x[i] > y[i]) {
	  //spadki.insert(MP(-y[i],i));
	  c.PB(MP(-y[i],i));
	  //duze.insert(MP(-x[i],i));
	  ////spadki.insert(MP(x[i] - y[i],i));
        }
        else if(x[i]==y[i]) ress[1].push_back(i);
        else a.PB(MP(x[i],i));
    }
    sort(a.begin(),a.end());
    sort(c.begin(),c.end());
    //sort(b.begin(),b.end());
    REP(i,SZ(a)) res.PB(a[i].ND);
    REP(i,SZ(ress[1])) res.PB(ress[1][i]);
    REP(i,SZ(c)) res.PB(c[i].ND);

    /*while(SZ(spadki) > 0) {
      PII q = *(spadki.begin());
      spadki.erase(q);
      res.PB(q.ND);
      }*/

    zycie = verify();
    if(zycie == 0) {
        printf("NIE\n");
        return 0;
    }
    printf("TAK\n");
    REP(i,SZ(res)) printf("%d ",res[i]); printf("\n");
    
  return 0;
}