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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))

template <typename T> int sgn(T val) {
  return (T(0) < val) - (val < T(0));
}

class Monster {
public:
  int loss, gain, nr;

  Monster(int nr_) {
    nr = nr_;
    scanf("%d%d", &loss, &gain);
  }

  int delta() const {
    return gain - loss;
  }

  void print() const {
    //printf("nr: %d, loss: %d, gain: %d, delta: %d\n", nr, loss, gain, delta());
  }
  bool operator<(const Monster &other) const {
    if (sgn(delta()) != sgn(other.delta())) {
      return delta() > other.delta();
    } else if (delta() > 0) {
      return loss < other.loss;
    } else if (delta() == 0) {
      return true;
    } else {
     return MP(gain, loss) > MP(other.gain, other.loss);
    }
  }
};


int main() {
  int n;
  LL z;
  scanf("%d%lld", &n, &z);

  vector<Monster> monsters;
  monsters.reserve(n);
  FOR(i,1,n) {
    monsters.PB(Monster(i));
  }
  sort(monsters.begin(), monsters.end());

  REP(i,n) {
    //printf("%d\n", monsters[i].nr);
    const Monster &monster = monsters[i];
    z -= monster.loss;
    if (z<=0LL) {
      printf("NIE\n");
      return 0;
    }
    z += monster.gain;
  }
  printf("TAK\n");
  REP(i,n) {
    printf("%s%d%s", i>0 ? " " : "", monsters[i].nr, i==n-1 ? "\n" : "");
  }

  return 0;
}