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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>

using namespace std;

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

    if (k == 1)
    {
        if (n > 2)
        {
            cout << "NIE\n";
            return;
        }
        if (n == 1)
        {
            cout << "P";
            cout << '\n';
        }
        else
        {
            cout << "PA";
            cout << '\n';
        }
    }
    else if (k == 2)
    {
        if (n > 4)
        {
            cout << "NIE\n";
            return;
        }
        if (n == 2)
        {
            cout << "PP";
            cout << '\n';
        }
        else if (n == 3)
        {
            cout << "PPA";
            cout << '\n';
        }
        else
        {
            cout << "PPAA";
            cout << '\n';
        }
    }
    else if (k == 3)
    {
        if (n > 8)
        {
            cout << "NIE\n";
            return;
        }
    
        for (int i = 0; i < k; ++i) cout << 'P';
        n -= k;
    
        if (n >= 2) cout << "AP";
        else if (n == 1) cout << "A";
    
        n -= 2;
    
        for (int i = 0; i < n; ++i) cout << 'A';
        cout << '\n';
    }
    else
    {
        for (int i = 0; i < k; ++i) cout << 'P';

        n -= k;

        string pattern = "APAAPP";
        for (int j = 0; j < n; ++j) cout << pattern[j % pattern.size()];
        cout << '\n';
    }
}

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

    int t;
    cin >> t;

    for (int i = 0; i < t; ++i) solve();
}