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
#include <iostream>
#include <string>
#include <vector>

using namespace std;

string solve() {
    int n, k;
    if (!(cin >> n >> k)) return "";

    string res = "";

    if (k == 1) {
        if (n == 1) res = "P";
        else if (n == 2) res = "PA";
        else res = "NIE";
    }
    else if (k == 2) {
        if (n < 2) res = "NIE";
        else if (n == 2) res = "PP";
        else if (n == 3) res = "PPA";
        else if (n == 4) res = "PPAA";
        else res = "NIE";
    }
    else if (k == 3) {
        if (n < 3) res = "NIE";
        else if (n == 3) res = "PPP";
        else if (n == 4) res = "PPPA";
        else if (n == 5) res = "PPPAP";
        else if (n == 6) res = "PPPAPA";
        else if (n == 7) res = "PPPAPAA";
        else if (n == 8) res = "PPPAPAAA";
        else res = "NIE";
    }
    else if (k == 4) {
        if (n < 4) res = "NIE";
        else if (n == 4) res = "PAAP";
        else {
            string ans;
            ans.reserve(n);
            string T4 = "PPAAPA";
            for (int i = 0; i < n; ++i) {
                ans += T4[i % 6];
            }
            res = ans;
        }
    }
    else {
        if (n < k) {
            res = "NIE";
        }
        else {
            string ans;
            ans.reserve(n);
            ans.append(k, 'P');
            if (n > k) {
                ans += 'A';
                string T4 = "PPAAPA";
                for (int i = 0; i < n - k - 1; ++i) {
                    ans += T4[i % 6];
                }
            }
            res = ans;
        }
    }
    return res;
}

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

    int t;
    if (cin >> t) {
        vector<string> results;
        results.reserve(t);

        while (t--) {
            results.push_back(solve());
        }

        for (const string& s : results) {
            if (!s.empty()) {
                cout << s << "\n";
            }
        }
    }
    return 0;
}