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
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

public class boh {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt(), z = s.nextInt();
		Enemy[] e = new Enemy[n];
		for (int i = 0; i < n; i++) {
			e[i] = new Enemy();
			e[i].id = i + 1;
			e[i].d = s.nextInt();
			e[i].a = s.nextInt();
			e[i].diff = e[i].a - e[i].d;
		}
		Arrays.sort(e);
		for (int i = 0; i < n; i++) {
			z -= e[i].d;
			if (z <= 0) {
				break;
			}
			z += e[i].a;
		}
		if (z <= 0) {
			System.out.println("NIE");
		} else {
			System.out.println("TAK");
			for (int i = 0; i < n; i++) {
				System.out.print(e[i].id + " ");
			}
		}
	}

}

class Enemy implements Comparable<Enemy> {
	public int id, d, a, diff;

	@Override
	public int compareTo(Enemy o) {
		// TODO Auto-generated method stub

		if (diff < 0 && o.diff >= 0) {
			return 1;
		}
		if (diff >= 0 && o.diff < 0) {
			return -1;
		}

		if (diff >= 0) {
			return a - o.a;
		}
		return o.d - d;
	}
}