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
#include <cstdio>
#include <cstdlib>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> PII;
typedef vector<PII > VPII;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef long long LL;
typedef long double LD;
#define CLR(x,a) memset(x,a,sizeof(x))
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; 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 MIN(a, b) ((a) < (b)) ? (a) : (b)
#define MAX(a, b) ((a) > (b)) ? (a) : (b)
#define ABS(a) ((a) > 0 ? (a) : (-(a)))
#define PB push_back
#define PF push_front
#define MP make_pair
#define ST first
#define ND second
#define INF 1000000009 //duża liczba
#define EPS (10e-9) //mała liczba
#define PI 3.14159265358979323846
#define RET return
LL gcd(LL n, LL m){return m==0?n:gcd(m,n%m);}
int gcd(int n, int m){return m==0?n:gcd(m,n%m);}
inline bool IsZero(LD x){return (x>-EPS && x<EPS);}
struct monster{
	int nr;
	int damage;
	int bonus;
};
vector<monster> monsters;

bool cmp(monster a, monster b){
	int a1=a.bonus-a.damage;
	int b1=b.bonus-b.damage;
	if(a1>0 && b1<=0) return 1;
	if(a1<=0 && b1>0) return 0;
	if(a1>0){
		if(b1==a1){
			if(a.damage==b.damage){
				return a.bonus>b.bonus;
			}
			return a.damage<b.damage;
		}
		return a1>b1;
	}else{
		if(a.damage==b.damage){
			return a1>b1;
		}
		return a.damage>b.damage;
	}
	
}
int main(){
	monster tmp;
	int n;
	LL z;
	scanf("%d %lld", &n, &z);
	FOR(i,1, n){
		tmp.nr=i;
		scanf("%d %d", &tmp.damage, &tmp.bonus);
		monsters.PB(tmp);
	}	
	sort(ALL(monsters), cmp);
	for(int i=0; i<monsters.size(); i++){
		z-=monsters[i].damage;
		if(z<=0){
			printf("NIE");
			RET 0;
		}else{
			z+=monsters[i].bonus;
		}
	}
	printf("TAK\n");
	for(int i=0; i<monsters.size(); i++){
		printf("%d ", monsters[i].nr);
	}
	RET 0;
}