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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
	ll n, k;
	cin >> n >> k;

	if (k == 1) {
		if (n > 2)
			cout << "NIE\n";
		else if (n == 1)
			cout << "A\n";
		else
			cout << "PA\n";
		return;
	} else if (k == 2) {
		if (n > 4)
			cout << "NIE\n";
		else if (n == 2)
			cout << "AA\n";
		else if (n == 3)
			cout << "PAA\n";
		else
			cout << "PPAA\n";
		return;
	} else if (k == 3) {
		vector<string> odp = {"NIE",
							  "NIE",
							  "AAA",
							  "PAAA",
							  "APAAA",
							  "PAPAAA",
							  "PPAPAAA",
							  "PPPAPAAA"};
		if (n > 8)
			cout << "NIE" << '\n';
		else
			cout << odp[n - 1] << '\n';
		return;
	}

	string s(k - 1, 'A');
	while (s.size() < n)
		s += "APPAPA";
	s.resize(n);
	cout << s << '\n';
}

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

	ll t;
	cin >> t;
	while (t--)
		solve();
}