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
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

struct Opp{
	int beg;
	int val;
	int num;
};

bool begRising(Opp a, Opp b){
	return a.beg<b.beg;
}
bool begFalling(Opp a, Opp b){
	return a.beg+a.val > b.beg+b.val;
}


int n;
int liv;
vector <Opp> Olower;
vector <Opp> Oupper;
Opp el;
vector <int> out;
bool alive=true;


int main(){
	scanf("%d%d",&n,&liv);
	int a,b;
	for(int i=1;i<=n;++i){
		scanf("%d%d",&a,&b);
		el.beg=a;
		el.val=b-a;
		el.num=i;
		if(el.val>=0){
			Oupper.push_back(el);
		}else{
			Olower.push_back(el);
		}
	}
	sort(Oupper.begin(),Oupper.end(),begRising);
	sort(Olower.begin(),Olower.end(),begFalling);
	
	for(int i=0;i<Oupper.size();++i){
		if(Oupper[i].beg>=liv){
			alive=false;
			break;
		}else{
			liv+=Oupper[i].val;
			out.push_back(Oupper[i].num);
		}
	}
	
	if(alive){
		for(int i=0;i<Olower.size();++i){
		if(Olower[i].beg>=liv){
			alive=false;
			break;
		}else{
			liv+=Olower[i].val;
			out.push_back(Olower[i].num);
			if(liv<=0){
				
				alive=false;
				break;
			}
		}
	}
	}
	
	if(!alive){
		printf("NIE\n");
	}else{
		printf("TAK\n");
		for(int i=0;i<n;++i){
			printf("%d ",out[i]);
		}
	}	
	return 0;
}