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

using namespace std;

#define fi first
#define se second

typedef long long ll;

const int MAXN = 1e5 + 7;

void solve(){

	int n, k;
    cin >> n >> k;
        
    if(k == 1){
        if(n <= 2) cout << string("PA").substr(0, n) << '\n';
        else cout << "NIE\n";
    } 
        
	else if(k == 2){
        if(n <= 4) cout << string("PPAA").substr(0, n) << '\n';
        else cout << "NIE\n";
    } 
        
	else if(k == 3){
        if(n <= 8) cout << string("PPPAPAAA").substr(0, n) << '\n';
        else cout << "NIE\n";
    } 
    
	else {
        string ans = "";
        ans.reserve(n);
        for(int i = 0; i < k; i++) ans += 'A';
        string lft = "PAPPAA";
        for(int i = 0; i < n - k; i++) ans += lft[i%6];
        cout << ans << '\n';
    }
}

bool multi = 1;

int main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	int t = 1;
	if(multi) cin >> t;
	
	while(t--){

		solve();
	}
	
	return 0;
}