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
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <stack>
#include <cstring>
#include <iomanip>
#include <ctime>
using namespace std;
#define pb push_back
#define INF 1001001001
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define vi vector<int>
#define SZ(x) ((int)((x).size()))
#define fi first
#define se second
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
inline void pisz(int n) { printf("%d\n",n); }
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){FOR(i,SZ(t))s<<t[i]<<" ";return s; }
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (__typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define TESTS wez(testow)while(testow--)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define IOS ios_base::sync_with_stdio(0);

const int max_size=100000;
char buf[max_size];
int buf_size=0,pos=0;

#define getbuf() buf_size=fread(buf,1,max_size,stdin)
#define get(tok) {if (pos>=buf_size) { if (feof(stdin)) tok=0;	else { getbuf();pos=0; tok=buf[pos++];}}else tok=buf[pos++];}
#define in(v) {int tok;get(tok);while (tok==' ' || tok=='\n')get(tok);v=tok-'0';get(tok);while(tok>='0' && tok<='9'){v*=10;v+=(tok-'0');get(tok);}}

int main () {
   int n, _life;
   in(n); in(_life);
   ll life = _life;
   vector<pair<pii, int> > dobre; // <<damage, regen>, i>
   vector<pair<pii, int> > zle; // <<-regen, damage>, i>
   FORI(i,n) {
      int damage, regen;
      in(damage); in(regen);
      if (regen >= damage) {
         // dobry
         dobre.pb(mp(mp(damage, regen), i));
      } else {
         // zly
         zle.pb(mp(mp(-regen, damage), i));
      }
   }
   sort(ALL(dobre));
   sort(ALL(zle));
   vi res; res.reserve(n);
   FOREACH(d,dobre) {
      const int damage = d->fi.fi, regen = d->fi.se, i = d->se;
      life -= damage;
      if (life <= 0) {
         printf("NIE");
         return 0;
      }
      life += regen;
      res.pb(i);
   }
   FOREACH(z,zle) {
      const int damage = z->fi.se, regen = - z->fi.fi, i = z->se;
      life -= damage;
      if (life <= 0) {
         printf("NIE");
         return 0;
      }
      life += regen;
      res.pb(i);
   }
   printf("TAK\n");
   FOREACH(it,res) printf("%d ", *it);   
}