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
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> para;

#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 VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair
#define MT make_tuple

typedef tuple<int,int,int> trojka;


int main() {
  int n, d, a, a0=0, m=100001;
  LL z, s=0, s1=0;
  trojka t;
  vector< trojka > bad, good;
  VI l;

  cin>>n>>z;

  FOR(i,1,n){
    scanf("%d%d", &d, &a);

    if (d>a) {
      s+=d-a;
      if (m>d-a) {m=d-a; a0=a;}
      bad.PB(MT(a,d,i));
      continue;
    }

    if (d<z) { z+=a-d; l.PB(i); }
    else { s1+=a-d; good.PB(MT(d, a-d, i)); }
  }

//  if (z+s1+a0<=s) {cout<<"NIE\n"; return 0;}   //uwaga

  sort(ALL(good));

  FOREACH(i,good) {
    t=*i;
    if (z <= get<0>(t)) {cout<<"NIE\n"; return 0;}
    z+=get<1>(t); l.PB(get<2>(t));
  }

  sort(ALL(bad));

  while(!bad.empty()) {
    t=bad.back();
    bad.pop_back();
    if (z <= get<1>(t)) {cout<<"NIE\n"; return 0;}
    z+=get<0>(t)-get<1>(t); l.PB(get<2>(t));
  }

  cout<<"TAK\n";
  FOREACH(i,l) cout<<*i<<" ";

  return 0;
}