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
//Bohater
//PA14
#include <cstdio>
#include <cmath>
#include <vector>
#define mini -1
#define maxi 1000000007
#include <algorithm>
using namespace std;








struct potwor{
	int wartosc,numer;
	
};



bool cmp(potwor a,potwor b){
	return a.wartosc>b.wartosc;

}




potwor pom;

int n,z,d,a;
vector<potwor> quest;






int main(){
	scanf("%d%d",&n,&z);
	
	for(int i=1;i<=n;++i){
		scanf("%d%d",&d,&a);
		pom.wartosc=a-d;
		pom.numer=i;
		quest.push_back(pom);
	}
	
	sort(quest.begin(),quest.end(),cmp);
	
	for(int i=0;i<quest.size();++i){
		z+=quest[i].wartosc;
	}
	
	if(z<=0){
		printf("NIE\n");
	}
	else{
		printf("TAK\n");
		for(int i=0;i<quest.size();++i)printf("%d ",quest[i].numer);/*printf("%d ",quest[i].wartosc);*/
		printf("\n");
	
	}
	
	
	

	return 0;
}