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
#include <iostream>

using namespace std;


long numOfMon;
long life;
long ** data;
long index[3];
long * newData;

void sortLife()
{
	for (long i=0; i<numOfMon-1; i++)
	{
		for (long j=0; j<numOfMon-i-1; j++)
		{
			if (data[2][newData[j]] < data[2][newData[j+1]])
			{
				long temp = newData[j];
				newData[j] = newData[j+1];
				newData[j+1] = temp;
			}
		}
	}
}

void specialSort()
{
	for (long i=0; i<index[1]-1; i++)
	{
		for (long j=0; j<index[1]-i-1; j++)
		{
			if (data[0][newData[j]] > data[0][newData[j+1]])
			{
				long temp = newData[j];
				newData[j] = newData[j+1];
				newData[j+1] = temp;
			}
		}
	}
	if (index[2] !=-1)
	{
		for (long i=index[2]; i<numOfMon-1; i++)
		{
			for (long j=index[2]; j<numOfMon+index[2]-i-1; j++)
			{
				if (data[0][newData[j]] < data[0][newData[j+1]])
				{
					long temp = newData[j];
					newData[j] = newData[j+1];
					newData[j+1] = temp;
				}
			}
		}
	}
}

void getIndex()
{
	index[0] = -1;
	index[1] = -1;
	index[2] = -1;

	for (long i=0; i<numOfMon; i++)
	{
		if (data[2][newData[i]] > 0)
		{
			if (index[0] == -1) index[0] = i;
		}
		if (data[2][newData[i]] == 0)
		{
			if (index[1] == -1) index[1] = i;
		}
		if (data[2][newData[i]] < 0)
		{
			if (index[2] == -1) index[2] = i;
		}
	}
}

void getAnswer()
{
	for (long i=0; i<numOfMon; i++)
	{
		life -= data[0][newData[i]];
		if (life <= 0) break;
		life += data[1][newData[i]];
	}
	if (life > 0)
	{
		cout << "TAK\n";
		for (long i=0; i<numOfMon; i++)
		{
			cout << newData[i]+1;
			if (i+1 != numOfMon) cout << " ";
		}
	}
	else 
	{
		cout << "NIE\n";
	}
}

int main()
{
	cin >> numOfMon;
	cin >> life;
	data = new long * [3];
	newData = new long [numOfMon];
	for (long i=0; i<3; i++)
	{
		data[i] = new long[numOfMon];
	}
	for (long i=0; i<numOfMon; i++)
	{
		cin >> data[0][i];
		cin >> data[1][i];
		newData[i] = i;
		data[2][i] = data[1][i] - data[0][i];
	}
	sortLife();
	getIndex();
	specialSort();
	getAnswer();
	return 0;
}