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

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 1'000'007;
int tab[N];

void Solve()
{
    int n, q;
    cin >> n >> q;
    
    vector<int> lim = {0, 2, 4, 8};
    string ans;
    if(q < 4 && n > lim[q])
    {
        cout << "NIE\n";
        return;
    }
    string wzo = "APPAAP";
    if(q == 1)
    {
        ans.pb('P');
        n -= 1;
    }
    if(q == 2)
    {
        wzo = "PPAA";
    }
    if(q == 3)
    {
        ans = "PPP";
        wzo = "APAAA";
        n -= 3;
    }
    if(q > 4)
    {
        for(int i = 1; i <= q; ++i)
            ans.pb('P');
        n -= q;
    }
    for(int i = 0; i < n; ++i)
        ans.pb(wzo[i % 6]);
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)
        Solve();

    return 0;
}