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
#include <bits/stdc++.h>

std::vector<std::pair<int, int>> preproc = {
	{0, 0b0},
	{1, 0b0},
	{1, 0b01},
	{2, 0b001},
	{2, 0b0011},
	{3, 0b00010},
	{3, 0b000101},
	{3, 0b0001011},
	{3, 0b00010111},
};

std::vector<bool> pattern = {1, 0, 1, 1, 0, 0};

void solve() {
	int n, k;
	std::cin >> n >> k;
	std::vector<bool> tab(n);

	if (n < preproc.size()) {
		if (k < preproc[n].first) {
			std::cout << "NIE\n";
			return;
		} else if (k == preproc[n].first) {
			for (int i = 0; i < n; i++) {
				tab[i] = (1 & (preproc[n].second>>i));
			}
		} else {
			for (int i = 0; i < n; i++) {
				tab[i] = (i < k);
			}	
		}
	} else {
		if (k < 4) {
			std::cout << "NIE\n";
			return;
		} else {
			for (int i = 0; i < k; i++) {
				tab[i] = false;
			}
			for (int i = 0; i < n - k; i++) {
				tab[i + k] = pattern[i % pattern.size()];
			}
		}
	}

	for (auto e : tab) {
		std::cout << (e ? 'P': 'A');
	}

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

int main() {
	int T;
	std::cin >> T;
	while (T--) {
		solve();
	}
}