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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

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

	int z; cin >> z;
	while(z--) {
		ll n, k;
		cin >> n >> k;
		if(k==1) {
			if(n==1) cout << "A\n";
			else if(n==2) cout << "PA\n";
			else cout << "NIE\n";
		} else if(k==2) {
			if(n <= 4) {
				string s = "PPAA";
				for(int i=0; i<n; ++i) cout << s[i];
				cout << "\n";
			} else cout << "NIE\n";
		} else if(k==3) {
			if(n <= 8) {
				string s = "PPPAPAAA";
				for(int i=0; i<n; ++i) cout << s[i];
				cout << "\n";
			} else cout << "NIE\n";
		} else {
			string s = "PAPPAA";
			for(int i=0; i<k; ++i) cout << "A";
			int idx = 0;
			for(int i=k; i<n; ++i) {
				cout << s[idx];
				idx = (idx+1)%s.size();
			}
			cout << "\n";
		}
	}

	return 0;
}