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
/*
 * PER
 * Autor: Szymon Tur
 */



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

using namespace std;

long long l,T;
long long n;
long long k;
vector<int> c, d;
int isSt()
{
	int s=0;
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<i;j++)
		if (c[j]>c[i]) ++s;
	}
	return s;
}
int main()
{
	
	cin >> n >> k;
	if ((n*(n-1))%4!=0) 
	{
		cout << "NIE";
		return 0;
	}
	else
	{
		
		T = n*(n-1)/4;
		//inne
		
		
		bool np = false;
		for (int i=1;i<=n;i++)
		{
			c.push_back(i);
			d.push_back(i);
		}
		for (int i=1;i<=k;i++)
		{
			while (next_permutation(c.begin(),c.end()) && isSt()!=T);
			if (c==d) 
			{
				cout << "NIE";
				return 0;
			}
		}
		
		cout << "TAK\n";
		for (int i=0;i<n;i++) cout << c[i] << " ";
		return 0;
		
	}
	
}