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
//Krzysztof Pieprzak
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <deque>
#include <stack>
#include <map>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define Size(x) (int)x.size()
#define VAR(v,n) typeof(n)v = (n)
#define FOR(i,a,b) for(VAR(i,a); i < (b); ++i)
#define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i)
#define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i)
#define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step))
#define FOREACH(i,c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define ALL(x) x.begin(),x.end()
#define CLEAR(t) memset(t, 0, sizeof(t))
#define F first
#define S second
#define MP make_pair
#define PUB push_back
#define POB pop_back
#define pieprzu ios_base::sync_with_stdio(0);

const int    INF = 1000000001;
const double EPS = 10e-9;

const int MAXN = 100005;

pair<pii,int> l[MAXN];
pair<pii,int> h[MAXN];
vi res;

void rob()
{
    int n;
    ll hp;
    scanf("%d %lld", &n, &hp);

    int lSize = 0;
    int hSize = 0;
    int a,b;
    FOR (i, 0, n)
    {
        scanf("%d %d", &a, &b);
        if (b >= a) h[hSize++] = MP(MP(a,b),i+1);
        else l[lSize++] = MP(MP(b,a),i+1);
    }

    sort(h,h+hSize);
    sort(l,l+lSize);

    FOR (i, 0, hSize)
    {
        if (h[i].F.F >= hp)
        {
            printf("NIE\n");
            return;
        }
        hp+=h[i].F.S-h[i].F.F;
        res.PUB(h[i].S);
    }

    FORREV (i, 0, lSize-1)
    {
        if (l[i].F.S >= hp)
        {
            printf("NIE\n");
            return;
        }
        hp+=l[i].F.F-l[i].F.S;
        res.PUB(l[i].S);
    }

    printf("TAK\n");
    FOREACH (el, res) printf("%d ", *el);printf("\n");
}

int main()
{
    int test = 1;
    //scanf("%d", &test);

    while (test--) rob();

    return 0;
}