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

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>

const int maxn = 1e6+7;

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

    string ans = "";
    if(k >= (n+1)/2){
        for(int i=1;i<=k;i++)
            ans += 'P';
        for(int i=k+1;i<=n;i++)
            ans += 'A';

        cout<<ans<<"\n";
        return;
    }
    if(k<=2){
        cout<<"NIE\n";
        return;
    }
    if(k==3){
        if(n > 8)
            cout<<"NIE\n";
        else{
            ans = "PPPAPAA";
            if(n==8)
                ans += 'A';
            cout<<ans<<"\n";
        }
        return;
    }

    for(int i=1;i<=k-2;i++)
        ans += 'P';
    for(int i=k-2+1;i<=n;i++){
        if((i-(k-2))%6==1 || (i-(k-2))%6==2 || (i-(k-2))%6==5)
            ans += 'P';
        else
            ans += 'A';
    }

    cout<<ans<<"\n";
}

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

    while(t--){
        solve();
    }

    return 0;
}