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
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#include <string>
#include <set>
#include <cstring>
#include <iostream>
#include <sstream>
#include <cassert>
using namespace std;

#define PB push_back
#define FORE(i,t) for(typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i,n) for(int i=0,_=(n);i<_;++i)
#define FOR(i,a,b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i,a,b) for(int i=(a),_=(b);i>=_;--i)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

struct Monster {

  int d, a, id;
  
  bool operator < (const Monster &y) const {
    bool x_plus = (a - d) >= 0;
    bool y_plus = (y.a - y.d) >= 0;
    if (x_plus == y_plus) {
      if (x_plus) {
        return d < y.d;
      }
      return a > y.a;
    }
    return x_plus;
  }
};

void inline jeden() {
  int n, z;
  scanf("%d%d", &n, &z);
  
  vector<Monster> monsters;

  REP(i, n) {
    int d, a;
    scanf("%d%d", &d, &a);
    monsters.PB((Monster){d, a, i + 1});
  }
  sort(monsters.begin(), monsters.end());
//  FORE (monster, monsters) {
//    printf("-%d +%d [%d]\n", monster->d, monster->a, monster->id);
//  }
  ll life = z;
  FORE (monster, monsters) {
    life -= monster->d;
    if (life <= 0) {
      break;
    }
    life += monster->a;
  }
  if (life > 0) {
    puts("TAK");
    FORE (monster, monsters) {
      printf("%d ", monster->id);
    }
    puts("");
  } else {
    puts("NIE");
  }
}

int main() {
  //int z; scanf("%d", &z); while(z--)
  jeden();
}