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

using namespace std;

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

    if (k == 1) {
        if (n == 1) cout << "A\n";
        else if (n == 2) cout << "AP\n";
        else cout << "NIE\n";
    } else if (k == 2) {
        if (n == 2) cout << "AA\n";
        else if (n == 3) cout << "AAP\n";
        else if (n == 4) cout << "AAPP\n";
        else cout << "NIE\n";
    } else if (k == 3) {
        string s = "AAAPAPPP";
        if (n <= 8) cout << s.substr(0, n) << "\n";
        else cout << "NIE\n";
    } else {
        string res;
        res.reserve(n);
        res.append(k, 'A');
        
        string s = "PAPPAA";
        int rem = n - k;
        int full = rem / 6;
        for (int i = 0; i < full; ++i) {
            res += s;
        }
        res += s.substr(0, rem % 6);
        
        cout << res << "\n";
    }
}

int main() {
    // Optymalizacja operacji wejścia/wyjścia (I/O)
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t;
    if (cin >> t) {
        while (t--) {
            solve();
        }
    }
    return 0;
}