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

using namespace std;
typedef long long ll;
void solve() {
    int n,k;
    cin>>n>>k;
    if (k==1) {
        if (n>2) {
            cout<<"NIE\n";
        }
        else if (n==1){
            cout<<"P\n";

        }
        else {
            cout<<"PA\n";
        }
        return;
    }
    else if (k==2) {
        if (n>4) {
            cout<<"NIE\n";
        }
        else {
            if (n==2) cout<<"PP\n";
            else if (n==3) cout<<"PPA\n";
            else {
                cout<<"AAPP\n";
            }
        }
        return;
    }
    else if (k==3) {
        if (n>8)
            cout<<"NIE\n";
        else {
            string s = "PPPAPAAA";
            cout<<s.substr(0, n)<<'\n';
        }

        return;
    }


    string s = "PPAPAA";
    for (int i=1; i<=k; i++) {
        cout<<"A";
    }
    for (int i=6; i<=n-k; i+=6) {
        cout<<s;
    }
    cout<<s.substr(0, (n-k)%6)<<'\n';
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}