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
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()

vector<vector<string>> ans;

void solve() {
    int n, k, i, j=0;
    cin >> n >> k;
    if(n<=8){
        cout << ans[n][k] << '\n';
        return;
    }
    if(k<=3){
        cout << "NIE\n";
        return;
    }
    string odp;
    string klu="PPAPAA";
    for(i=0; i<k; i++){
        odp+='A';
    }
    for(i=k; i<n; i++){
        odp+=klu[j];
        j++;
        j%=6;
    }
    cout << odp << '\n';
}

signed main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ans.resize(10);
    ans[0]={"0"};
    ans[1]={"1","P"};
    ans[2]={"2","AP","PP"};
    ans[3]={"3","NIE","AAP","AAA"};
    ans[4]={"4","NIE","AAPP","AAAP","AAAA"};
    ans[5]={"5","NIE","NIE","AAAPP","AAAAP","AAAAA"};
    ans[6]={"6","NIE","NIE","AAAPPP","AAAAPP","AAAAAP","AAAAAA"};
    ans[7]={"7","NIE","NIE","AAAPAPP","AAAAPPP","AAAAAPP","AAAAAAP","AAAAAAA"};
    ans[8]={"8","NIE","NIE","AAAPAPPP","AAAAPPPP","AAAAAPPP","AAAAAAPP","AAAAAAAP","AAAAAAAA"};
    int t = 1;
    cin >> t;
    while(t-- ) solve();
}