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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>

using namespace std;

typedef long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#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 PB push_back
#define ST first
#define ND second

struct s
{
	int death;
	int health;
	int idx;
};

#define M 100100

bool comp_plus (s i, s j) { 
	if(i.death == j.death)
	{
		return i.health -j.health < 0;
	}
	else
	{
		return (i.death - j.death < 0); 
	}
}

bool comp_minus (s i, s j) { 
	if(i.health == j.health)
	{
		return (i.death - j.death < 0);	
	}
	else
	{
		return (i.health - j.health > 0); 
	}
}



int main() {
	int n, z;
	int pit = 0, mit = 0;
	int zero_max = -1;
	vector<s> plu;
	vector<s> minu;
	vector<int> zero_idx;
	scanf("%d %d", &n, &z);
	REP(i, n)
	{
		int d, h, res;	
		scanf("%d %d", &d, &h);
		res = -d + h;
		s str;
		str.death = d;
		str.health = h;
		str.idx = i + 1;

		if(res > 0)
		{
			plu.PB(str);
		}
		else if(res < 0)
		{
			minu.PB(str);
		}
		else
		{
			zero_max = MAX(zero_max, d);
			zero_idx.PB(i + 1); 
		}
	}

	bool success = true;
	LL life = z;
	sort(plu.begin(), plu.end(), comp_plus);
	FOREACH(i, plu)
	{
	//	cout<<"[LIFE: "<< life <<"], PLUS: "<<i->death<<", "<<i->health<<"."<<endl;
		if(life <= (LL)(i->death))
		{
			success = false;
			break;
		}
		
		life += (LL)(i->health - i->death);
	}
	if(life <= (LL)zero_max)
	{
		//cout<<"[LIFE: "<< life <<"], zero_max: "<<zero_max<<endl;
		success = false;
	}
	
	if(success)
	{
		sort(minu.begin(), minu.end(), comp_minus);	
		FOREACH(i, minu)
		{
		//	cout<<"[LIFE: "<< life <<"], MINUS: "<<i->death<<", "<<i->health<<"."<<endl;
			if(life <= (LL)(i->death))
			{	
				success = false;
				break;
			}
			
			life += (LL)(i->health - i->death);
		}
	}

	if(success)
	{
		printf("TAK\n");
		FOREACH(i, plu)
			printf("%d ", i->idx);
		FOREACH(i, zero_idx)
			printf("%d ", *i);
		FOREACH(i, minu)
			printf("%d ", i->idx);	
		printf("\n");
		
	}	
	else
	{
		printf("NIE\n");
	}	

	return 0;
}