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
#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);

vector<pair<pii,int> > dod,zero,uj;

int main()
{
    wez2(n,life);
    for(int i=0;i<n;i++)
    {
            wez2(d,a);
            if(a-d>0)dod.pb(mp(mp(d,a),i+1));
            else if(a-d==0)zero.pb(mp(mp(d,a),i+1));
            else uj.pb(mp(mp(a,d),i+1));
    }
    sort(dod.begin(),dod.end());
    sort(zero.begin(),zero.end());
    sort(uj.begin(),uj.end());
    ll temp = life;
    bool ok=true;
    for(int i=0;i<dod.size();i++)
    {
            if(temp > dod[i].first.first)temp+=dod[i].first.second-dod[i].first.first;
            else ok=false;        
    }
    for(int i=0;i<zero.size();i++)
    {
            if(temp > zero[i].first.first)temp+=zero[i].first.second-zero[i].first.first;
            else ok=false;        
    }
    for(int i=uj.size()-1;i>=0;i--)
    {
            if(temp > uj[i].first.second)temp+=uj[i].first.first-uj[i].first.second;
            else ok=false;        
    }
    if(ok)
    {
            printf("TAK\n");
            for(int i=0;i<dod.size();i++)printf("%d ",dod[i].second);
            for(int i=0;i<zero.size();i++)printf("%d ",zero[i].second);
            for(int i=uj.size()-1;i>=0;i--)printf("%d ",uj[i].second);
            printf("\n");
    }
    else printf("NIE\n");
    return 0;   
}