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
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

typedef pair<pii, int> Elem;

const int N = 101001;
Elem zbior[N];
int n, z;

int sign(int x) {
	if (x > 0) return 1;
	else if (x == 0) return 0;
	return -1;
}

bool compFun(const Elem& a, const Elem& b) {
	int diffA = a.ST.ST - a.ST.ND, diffB = b.ST.ST - b.ST.ND;
	int signA = sign(diffA), signB = sign(diffB);
	if (signA != signB) {
		return signA < signB;
	} else {
		if (signA < 0) {
			if (a.ST.ST != b.ST.ST) return a.ST.ST < b.ST.ST;
		} else if (signA > 0) {
			return a.ND < b.ND;
		}
		return a.ND < b.ND;
	}
}

bool compMoreFun(const Elem& a, const Elem& b) {
	if (a.ST.ND != b.ST.ND) return a.ST.ND < b.ST.ND;
	return a.ND < b.ND;
}

int main() {
	scanf("%d %d", &n, &z);
	REP(i, n) {
		scanf("%d %d", &zbior[i].ST.ST, &zbior[i].ST.ND);
		zbior[i].ND = i + 1;
	}
	sort(zbior, zbior + n, compFun);
	ll curr = z;
	bool ok = true;
	int wsk = 0;
	vi kol;
	while (wsk < n && zbior[wsk].ST.ST <= zbior[wsk].ST.ND) {
		curr -= zbior[wsk].ST.ST;
		if (curr <= 0) {
			ok = false;
			break;
		}
		curr += zbior[wsk].ST.ND;
		kol.PB(zbior[wsk].ND);
		++wsk;
	}
	if (wsk < n) {
		vector<Elem> poz(zbior + wsk, zbior + n);
		sort(ALL(poz), compMoreFun);
		int zost = n - wsk;
		ll minim = 1;
		REP(i, zost) {
			if (poz[i].ST.ND >= minim) {
				minim = poz[i].ST.ND + 1;
			}
			minim -= poz[i].ST.ND;
			minim += poz[i].ST.ST;
		}
		if (minim <= curr) {
			FORD(i, zost, 0) {
				kol.PB(poz[i].ND);
			}
		} else {
			ok = false;
		}
	}
	printf("%s\n", ok ? "TAK" : "NIE");
	if (ok) {
		for (const int& p : kol) printf("%d ", p);
		printf("\n");
	}
	return 0;
}