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
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>

using namespace std;

typedef long long ll;

char S[] = "PPAAPA";

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

    int t, n, k;
    cin >> t;
    while (t--) {
        cin >> n >> k;
        if (k == 1) {
            if (n == 1) {
                cout << "A";
            } else if (n == 2) {
                cout << "PA";
            } else cout << "NIE" << endl;
        } else if (k == 2) {
            if (n <= 4) {
                for (int i = 0; i < 2; i++) cout << "A";
                for (int i = 0; i < n - 2; i++) cout << "P";
            } else {
                cout << "NIE";
            }
        } else if (k == 3) {
            if (n < 7) {
                for (int i = 0; i < 3; i++) cout << "P";
                for (int i = 0; i < n - 3; i++) cout << "A";
            } else if (n == 7) {
                cout << "PPAPAAA";
            } else if (n == 8) {
                cout << "PPPAPAAA";
            } else cout << "NIE";
        } else {
            for (int i = 0; i < k - 2; i++) {
                cout << "P";
            }
            for (int i = 0; i < n - k + 2; i++) cout << S[i % 6];
        }
        cout << "\n";
        cout.flush();
    }

    return 0;
}