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
#include <iostream>
#include <vector>

int main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);

	int n, k;

	std::cin >> n >> k;

	int *arr = new int[n]();

	if (n % 4 == 2 || n % 4 == 3)
	{
		std::cout << "NIE";

		return 0;
	}
	
	std::vector<int> possible;

	for (int i = 0; i <= k; i++)
	{
		for (int j = 0; j < n * (n - 1) / 4; j++)
		{
			int x = 0;

			while (true)
			{
				if (x > n)
				{
					break;
				}

				arr[x]++;

				if (arr[x] > x + 1)
				{
					arr[x] = 0;
					x++;
					continue;
				}

				break;
			}
		}
	}

	possible.reserve(n);

	for (int i = 0; i < n; i++)
	{
		possible.push_back(i + 1);
	}

	std::cout << "TAK\n";

	for (int i = 0; i < n; i++)
	{
		std::cout << possible[arr[i]] << ' ';
		possible.erase(possible.begin() + arr[i]);
	}

	return 0;
}