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

typedef vector <int > VI;
typedef vector < VI > VVI;
typedef long long LL;
typedef vector < LL > VLL;
typedef vector < double > VD;
typedef vector < string > VS;
typedef pair<int,int> PII;
typedef vector <PII> VPII;
typedef istringstream ISS;

#define ALL(x) x.begin(),x.end()
#define REP(i,n) for (int i=0; i<(n); ++i)
#define FOR(var,pocz,koniec) for (int var=(pocz); var<=(koniec); ++var)
#define FORD(var,pocz,koniec) for (int var=(pocz); var>=(koniec); --var)
#define FOREACH(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); ++it)
#define PB push_back
#define PF push_front
#define MP(a,b) make_pair(a,b)
#define ST first
#define ND second
#define SIZE(x) (int)x.size()

const int N = 101 * 1010;
int takes[N], gives[N];

int main(){
  int n;
  LL z;
  scanf("%d %lld",&n,&z);
  REP(i,n) scanf("%d %d",takes+i,gives+i);
  VPII v;
  v.reserve(n);
  REP(i,n) if (takes[i] <= gives[i]) v.PB(MP(takes[i], i));
  else v.PB(MP(2 * N - gives[i], i));
  sort(ALL(v));
  int ok = 1;
  FOREACH(it, v) {
    int x = it->ND;
    if (takes[x] >= z){
      ok = 0;
      break;
    }
    z -= takes[x];
    z += gives[x];
  }
  if (ok) {
    puts("TAK");
    REP(i,n) {
      if (i) printf(" ");
      printf("%d", v[i].ND+1);
    }
    puts("");
  } else puts("NIE");
  return 0;
}