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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge {c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

typedef long long ll;
const ll INF = 1.01e18L;

void NIE() {
	puts("NIE");
	exit(0);
}

vector<vector<ll>> dp;

ll get(ll n, ll inv) {
	if(inv > (ll) n * (n - 1) / 2)
		return 0;
	inv = min(inv, (ll) n * (n - 1) / 2 - inv);
	if(inv >= (int) dp[n].size())
		return INF;
	return dp[n][inv];
}

void preprocessing(int N) {
	dp.resize(N + 1);
	ll total_size = 0;
	for(int n = 0; n <= N; ++n) {
		dp[n].push_back(1);
		for(ll inv = 1; inv <= (ll) n * (n - 1) / 2; ++inv) {
			ll ways = 0;
			for(int extra = 0; extra <= min((ll) n - 1, inv); ++extra) {
				ways += get(n - 1, inv - extra);
				if(ways >= INF) break;
			}
			if(ways >= INF) break;
			dp[n].push_back(ways);
		}
		total_size += dp[n].size();
	}
	//~ cerr << "total_size = " << total_size << "\n";
}

const int pot = 256 * 1024;
int tr[2*pot];

int rec(int id, int need) {
	if(id >= pot) {
		assert(tr[id] == 1);
		assert(need == 1);
		return id - pot;
	}
	if(tr[2*id] >= need) return rec(2 * id, need);
	return rec(2 * id + 1, need - tr[2*id]);
}

void turnOff(int x) {
	for(int i = pot + x; i >= 1; i /= 2)
		tr[i]--;
}

int main() {
	ll n, k;
	cin >> n >> k;
	
	preprocessing(n);
	// tree init
	for(int i = 0; i < n; ++i)
		tr[pot+i] = 1;
	for(int i = pot - 1; i >= 1; --i)
		tr[i] = tr[2*i] + tr[2*i+1];
	
	ll should = n * (n - 1) / 4;
	if(2 * should != n * (n - 1) / 2)
		NIE();
	if(get(n, should) < k)
		NIE();
	puts("TAK");
	
	for(int rem = n - 1; rem >= 0; --rem) {
		bool ok = false;
		ll possible_inv = (ll) rem * (rem - 1) / 2;
		for(int extra = max(0LL, should - possible_inv); extra <= min(should, (ll) rem); ++extra) {
			ll tmp = get(rem, should - extra);
			if(tmp >= k) {
				should -= extra;
				
				// tree
				int which = rec(1, extra + 1);
				debug() << imie(rem) imie(which);
				turnOff(which);
				
				printf("%d", which + 1);
				
				ok = true;
				break;
			}
			k -= tmp;
		}
		assert(ok);
		if(rem != 0) printf(" ");
	}
	puts("");
}