#include <iostream>     
#include <algorithm>    
#include <vector>       

using namespace std;

class Monster{
    public:
        int id;
        int damage;
        int potion;
        int compareValue;
        
        Monster(){
        }
        
        Monster(int _id, int _damage, int _potion){
            this->id = _id;
            this->damage = _damage;
            this->potion = _potion;
            if (_potion - _damage >= 0){
                this->compareValue = -100001 + _damage;
            }
            else{
                this->compareValue = 100000 - _potion;
            }
        };

        inline bool operator< (const Monster& right){
            return this->compareValue < right.compareValue;
        };
};


int main () {
    
    int amountOfMonstres;
    long long currentHP;
    cin >> amountOfMonstres >> currentHP;
    vector<Monster> monsters;
    int damage, potion;
    
    for(int id = 1; id<=amountOfMonstres; id++){
        cin >> damage >> potion;
        monsters.push_back(Monster(id,damage,potion));
    }
    make_heap (monsters.begin(), monsters.end());
    sort_heap (monsters.begin(),monsters.end());
    
    int iterator = 0;
    bool died = false;
    while((iterator<amountOfMonstres) && (!died)){
        if(currentHP - monsters[iterator].damage > 0){
            currentHP = currentHP - monsters[iterator].damage + monsters[iterator].potion;
        }
        else{
            died = true;
        }
        iterator++;
    }
    
    if(died){
        cout << "NIE\n";
    }
    else{
        cout << "TAK\n" << monsters[0].id;
        for (int i=1; i<amountOfMonstres; i++){
            cout << ' ' << monsters[i].id;
        }
        cout << '\n';
    }
    return 0;
};