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
85
86
87
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,1,(n)+1)
typedef vector<int> vi;
#define pb push_back
typedef pair<int,int> pii;
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
#define INF 1000000001
#define sz size()
#define VAR(n,v) typeof(v) n=(v)
#define ALL(t) t.begin(),t.end()
#define SC(a) scanf("%d", &a)
#define GET(a) int a; SC(a)
#define ISDEBUG 1
#define dprintf(...) if(ISDEBUG) \
{printf("\033[31m"); printf(__VA_ARGS__); printf("\033[0m");}
template <class It> void dptab(It b, It e, const char* f="%d ") {
	if(ISDEBUG) {
		for(It it=b; it!=e; ++it) dprintf(f, *it); dprintf("\n");
}}

struct monster {
	int damage;
	int gain;
	int index;
	int diff() const { return gain-damage; }
	bool hard() const { return diff() < 0; }
	monster(int damage, int gain, int index):
		damage(damage), gain(gain), index(index) {}
	
	bool operator<(const monster &t) const {
		if(hard() != t.hard()) {
			return hard() < t.hard();
		} else if(hard()) {
			if(gain != t.gain) return gain > t.gain;
			else return index < index;
		} else {
			if(damage != t.damage) return damage < t.damage;
			else return index < index;
		}
	}
};

int main() {
	GET(n);
	ll health;
	scanf("%lld", &health);
	vector<monster>monsters;
	FOR(i,0,n) {
		GET(damage);
		GET(gain);
		monsters.pb(monster(damage, gain, i+1));
	}
	
	sort(ALL(monsters));
	
	bool ok = true;
	FOR(i,0,n) {
		monster m = monsters[i];
		health -= m.damage;
		if(health <= 0) {
			ok = false;
			break;
		}
		health += m.gain;
	}
	if(ok) {
		printf("TAK\n");
		FOR(i,0,n)
			printf("%d ", monsters[i].index);
		printf("\n");
	} else 
		printf("NIE\n");
	return 0;
}