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
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

struct mobGOOD {
    int dmg, hp, identifity;
    mobGOOD () {};
    mobGOOD (int x, int y, int z){
        dmg = x;
        hp = y;
        identifity = z;
    }
    bool operator<(const mobGOOD M)
    const {
        if (dmg > M.dmg) return true;
        if (dmg < M.dmg) return false;
        if (hp < M.hp) return true;
        if (hp > M.hp) return false;
        if (identifity > M.identifity) return true;
        if (identifity < M.identifity) return false;
    }
};

struct mobBAD {
    int dmg, hp, identifity;
    mobBAD () {};
    mobBAD (int x, int y, int z){
        dmg = x;
        hp = y;
        identifity = z;
    }

    bool operator<(const mobBAD M)
    const {
        if (hp > M.hp) return false;
        if (hp < M.hp) return true;
        if (dmg > M.dmg) return false;
        if (dmg < M.dmg) return true;
        if (identifity > M.identifity) return true;
        if (identifity < M.identifity) return false;
    }
};

priority_queue <mobGOOD> GOOD;
priority_queue <mobBAD> BAD;
vector <int> order;

void read(int x){
    for (int i=1; i<=x; i++){
        int dmg, hp;
        scanf("%d %d", &dmg, &hp);
        if (hp - dmg > 0)
            GOOD.push(mobGOOD(dmg, hp, i));
        else BAD.push(mobBAD(dmg, hp, i));
    }
}

int main(){
    int x, myhp;
    scanf("%d %d", &x, &myhp);
    read (x);

    while (!GOOD.empty()){
        mobGOOD M;
        M = GOOD.top();
        GOOD.pop();

        if (M.dmg >= myhp) {
            printf ("NIE\n");
            return 0;
        }

        myhp = myhp + M.hp - M.dmg;
        order.push_back(M.identifity);
    }

    while (!BAD.empty()){
        mobBAD M;
        M = BAD.top();
        BAD.pop();

        if (M.dmg >= myhp) {
            printf ("NIE\n");
            return 0;
        }

        myhp = myhp - M.dmg + M.hp;
        order.push_back(M.identifity);
    }

    printf ("TAK\n");
    for (int i=0; i<order.size(); i++) printf ("%d ", order[i]);

    return 0;
}