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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

int main()
{
	int n;
	LL z;
	scanf("%d%lld", &n, &z);
	vector < pair < pair < int, int >, int > > v1, v2;
	REP(i,n)
	{
		int d, a;
		scanf("%d%d", &d, &a);
		if(a-d >= 0) v1.PB(MP(MP(d,a-d),i+1));
		else v2.PB(MP(MP(a,d),i+1));		
	}
	//wektory z kolejnoscia
	vector < int > res1, res2;
	//easy - zajmij sie v1 - maksymalizuj z jak sie da
	sort(v1.begin(), v1.end());
	REP(i,(int)v1.size())
	{
		if(v1[i].ST.ST >= z)
		{
			printf("NIE\n");
			return 0;
		}
		z += v1[i].ST.ND;
		res1.PB(v1[i].ND);
	}
	//hard - zajmij sie ujemnymi punktami 
	sort(v2.begin(), v2.end());
	FORD(i,(int)v2.size(),0)
	{
		if(z <= v2[i].ST.ND)
		{
			printf("NIE\n");
			return 0;
		}
		z -= v2[i].ST.ND;
		z += v2[i].ST.ST;
		res2.PB(v2[i].ND);
	}
	printf("TAK\n");
	REP(i,(int)res1.size()) printf("%d ", res1[i]);
	REP(i,(int)res2.size()) printf("%d ", res2[i]);
	printf("\n");
	return 0;
}