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
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <cstdio>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <cstring>
#define REP(i,x,v)for(int i=x;i<=v;i++)
#define REPD(i,x,v)for(int i=x;i>=v;i--)
#define FOR(i,v)for(int i=0;i<v;i++)
#define FORE(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define FOREACH(i,t) FORE(i,t)
#define REMIN(x,y) (x)=min((x),(y))
#define REMAX(x,y) (x)=max((x),(y))
#define pb push_back
#define sz size()
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define IN(x,y) ((y).find((x))!=(y).end())
#define un(v) v.erase(unique(ALL(v)),v.end())
#define LOLDBG
#ifdef LOLDBG
#define DBG(vari) cerr<<#vari<<" = "<<vari<<endl;
#define DBG2(v1,v2) cerr<<(v1)<<" - "<<(v2)<<endl;
#else
#define DBG(vari)
#define DBG2(v1,v2)
#endif
#define CZ(x) scanf("%d",&(x));
#define CZ2(x,y) scanf("%d%d",&(x),&(y));
#define CZ3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z));
#define ALL(x) (x).begin(),(x).end()
#define tests int dsdsf;cin>>dsdsf;while(dsdsf--)
#define testss int dsdsf;CZ(dsdsf);while(dsdsf--)
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
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){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; }


pii p[111111];
int n;

bool por(pair<pii,int> A, pair<pii,int> B)
{
    if (A.fi.fi<=A.fi.se && B.fi.fi<=B.fi.se) return A.fi.fi<B.fi.fi;
    if (A.fi.fi<=A.fi.se && !(B.fi.fi<=B.fi.se)) return 1;
    if (!(A.fi.fi<=A.fi.se) && B.fi.fi<=B.fi.se) return 0;
    return (A.fi.se>B.fi.se);
}

bool check(vi v,ll z)
{
    int n=v.sz;
    FOR(i,n)
    {
        if (p[v[i]].fi>=z) return 0;
        z=z-p[v[i]].fi+p[v[i]].se;
    }
    return 1;
}

vi brut(int z)
{
	vi v;
	FOR(i,n) v.pb(i);
	while(1)
	{
		if (check(v,z)) return v;
		if (!next_permutation(ALL(v))) break;
	}
	return vi();
}

void sol(int z)
{
	vector<pair<pii,int> > v;
	FOR(i,n) v.pb(mp(p[i],i));
    sort(ALL(v),por);
    //DBG(v);
    ll Z=z;
    FOR(i,n)
    {
        Z-=v[i].fi.fi;
        if (Z<=0) break;
        Z+=v[i].fi.se;
    }
    if (Z>0)
    {
    	//vi g;
    	//FOR(i,n) g.pb(v[i].se);
    	//return g;
        puts("TAK");
        FOR(i,n)printf("%d ",v[i].se+1);
    }
    else
	{
		//return vi();
		puts("NIE");
	}
}

int main()
{
    CZ(n);
    int z;CZ(z);
    FOR(i,n)
    {
        int a,b;CZ2(a,b);
        p[i]=mp(a,b);
    }
    sol(z);
    return 0;




    return 0;
}