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
#include <stdio.h>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define ll long long int

int main()
{
	int N;
	ll Z;
	cin >> N >> Z;
	int* tab = new int[2*N];
	vector<pair<int,int> > fir;
	vector<pair<int,int> > las;
	vector<int> output;
	for( int t = 0; t < N; ++t )
	{
		int a, b;
		cin >> a >> b;
		tab[2*t] = a;
		tab[2*t+1] = b;
		if( b >= a )
		{
			fir.push_back(make_pair(a,t));
		}
		else
		{
			las.push_back(make_pair(b,t));
		}
	}
	sort(fir.begin(),fir.end());
	sort(las.begin(),las.end());

	bool good = true;
	for(int i = 0; i < (int) fir.size(); ++i )
	{
		output.push_back(fir[i].second);
		if( Z - (ll)(fir[i].first) <= 0 )
		{
			good = false;
			break;
		}
		else
		{
			Z = Z - (ll)fir[i].first + (ll)tab[2*fir[i].second+1];
		}
	}
	for(int i = (int) las.size()-1; i >= 0; --i )
	{
		output.push_back(las[i].second);
		if( Z - (ll)(tab[2*las[i].second]) <= 0 )
		{
			good = false;
			break;
		}
		else
		{
			Z = Z - (ll)tab[2*las[i].second] + (ll)las[i].first;
		}
	}
	if( good )
	{
		printf("TAK\n");
		for(int i = 0; i < N; ++i)
		{
			printf("%d ", output[i]+1);
		}
		printf("\n");
	}
	else
		printf("NIE\n");
	return 0;
}