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
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
#include <ext/numeric>
using namespace std ;
using namespace __gnu_cxx ;
typedef long long LL ;
typedef pair<int,int> PII ;
typedef vector<int> VI ;
const int INF = 1000*1000*1000 ;
const LL INFLL = (LL)INF * (LL)INF ;
#define REP(i,n) for(i=0;i<(n);++i)
#define ALL(c) c.begin(),c.end()
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define CLEAR(t) memset(t,0,sizeof(t))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second

const int MAXN = 100100 ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	int n, i, d, a ;
	LL z ;
	cin >> n >> z ;
	vector<pair<PII, int> > A, B ;
	for(i=1 ; i<=n ; i++) {
		cin >> d >> a ;
		if(d<=a) A.PB(MP(MP(d,a),i)) ;
		else B.PB(MP(MP(a,d),i)) ;
	}
	sort(ALL(A)) ;
	sort(ALL(B)) ;
	reverse(ALL(B)) ;
	FOREACH(it, B)
		A.PB(MP(MP(it->FI.SE,it->FI.FI), it->SE)) ;
	
	bool ok = true ;
	FOREACH(it, A) {
		z -= it->FI.FI ;
		ok = ok && (z>0) ;
		z += it->FI.SE ;
	}
	
	if(!ok) cout << "NIE" << endl ;
	else {
		cout << "TAK" << endl ;
		FOREACH(it, A) cout << it->SE << " " ;
		cout << endl ;
	}
}