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
//Komasz Tasperowicz
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

#define FI first
#define SE second
#define MP make_pair

using namespace std;

const int INF = 1e9+1;
const int M = 1e5+1;


void linsort (vector <pair <int, int> >& v)
{
	int l = v.size();
	//vector <pair <int, int>
}

int main()
{
	int n,hp;
	scanf("%d %d", &n, &hp);
	vector <pair <int, int> > t(n);
	vector <int> w;
	for (int i=0; i<n; ++i)
	{
		scanf("%d %d", &t[i].FI, &t[i].SE);
	}
	sort(t.begin(), t.end()); // LIN !
	priority_queue <pair <int, int> > qu;
	int j=-1;
	while (j+1 < n && hp-t[j+1].FI > 0)
	{
		++j;
		qu.push(MP(t[j].SE-t[j].FI, j));
	}
	
	
	while (!qu.empty())
	{
		hp -= t[qu.top().SE].FI;
		if (hp <= 0)
		{
			printf("NIE\n");
			return 0;
		}
		hp += t[qu.top().SE].SE;
		w.push_back(qu.top().SE+1);
		qu.pop();
		while (j+1 < n && hp-t[j+1].FI > 0)
		{
			++j;
			qu.push(MP(-t[j].SE+t[j].FI, j));
		}
	}
	
	if (j == n-1)
	{
		printf("TAK\n");
		for (int i=0; i<n; ++i)
		{
			printf("%d ", w[i]);
		}
		printf("\n");
	}
	else
	{
		printf("NIE\n");
	}
	
	
	
	return 0;
}