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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <iterator>
#include <tr1/unordered_map>


using namespace std;

typedef vector<int> VI;
typedef long long LL;

#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(x,n) __typeof(n) x = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(c) ((int)(c).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end(); ++i)
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define MP make_pair
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define MAX(a,b) ((a) > (b) ? (a) : (b))

struct def {
    int idx;
    int dam;
    int lif;
};

bool comp(const def& def1, const def& def2){
    return def1.dam < def2.dam;
}

#define N 100002

def wzrost[N];
def spadek[N];



int main(){
    int n,w,s,d,l,start,end,ok;
    scanf("%d %d", &n, &start);
    w = s = 0;
    end = start;
    FOR(i,1,n){
        scanf("%d %d", &d, &l);
        if(d > l){
            spadek[s].idx = i;
            spadek[s].dam = l;
            spadek[s++].lif = d;
            end += l-d;
        }
        else {
            wzrost[w].idx = i;
            wzrost[w].dam = d;
            wzrost[w++].lif = l;
            end += l-d;
        }
    }
    sort(wzrost,wzrost+w,comp);
    sort(spadek,spadek+s,comp);

    ok = 1;
    REP(i,w){
        if(wzrost[i].dam >= start){
            ok = 0;
            break;
        }
        else {
            start += wzrost[i].lif-wzrost[i].dam;
        }
    }
    if(ok)
        REP(i,s){
            if(spadek[i].dam >= end){
                ok = 0;
                break;
            }
            else {
                end += spadek[i].lif - spadek[i].dam;
            }
        }

    if(ok){
        printf("TAK\n");
        REP(i,w)
            printf("%d ", wzrost[i].idx);
        FORD(i,s-1,0)
            printf("%d ", spadek[i].idx);
        printf("\n");
    }
    else
        printf("NIE\n");
    return 0;
}