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
// Author : Jakub Rożek
// Task   : PAL – Palindromy [C]
// Memory : 1
// Time   : ∑ n

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

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

    if (k == 1) {
        if (n == 1) cout << "P\n";
        else if (n == 2) cout << "PA\n";
        else cout << "NIE\n";
        return;
    }
    if (k == 2) {
        if (n == 2) cout << "PP\n";
        else if (n == 3) cout << "PPA\n";
        else if (n == 4) cout << "PPAA\n";
        else cout << "NIE\n";
        return;
    }
    if (k == 3) {
        if (n == 3) cout << "PPP\n";
        else if (n == 4) cout << "PPPA\n";
        else if (n == 5) cout << "PPPAP\n";
        else if (n == 6) cout << "PPPAPA\n";
        else if (n == 7) cout << "PPPAPAA\n";
        else if (n == 8) cout << "PPPAPAAA\n";
        else cout << "NIE\n";
        return;
    }
    // k >= 4
    for (int i=1; i<=k-2; ++i) cout << "P";
    for (int i=0; i<n-k+2; ++i) cout << "PPAPAA"[i % 6];
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}