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
92
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) int(a.size())
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) f(i, 0, a)
#define int ll
#define tv(a, x) for (auto& a : x)
#define DUZO 1000000000000000000LL
#define en "\n"
#define cn continue
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<pii>;

int n, k;

string wzor = "PAAPAP";
string wyn = "";

void dop() {
    int wsk = 0;
    while (sz(wyn) < n) {
        wyn += wzor[wsk];
        wsk++;
        wsk %= sz(wzor);
    }
    cout << wyn << en;
}

void solve() {
    wyn = "";
    cin >> n >> k;
    if (k == 1) {
        if (n == 1) {
            cout << "A" << en;
            return;
        } else if (n == 2) {
            cout << "PA" << en;
            return;
        } else {
            cout << "NIE" << en;
            return;
        }
    } else if (k == 2) {
        if (n > 4) {
            cout << "NIE" << en;
            return;
        }
        string ans = "AA";
        f(i, 0, n - 2) ans += 'P';
        cout << ans << en;
        return;
    } else if (k == 3) {
        string ans = "AAAPAPPP";
        if (n > sz(ans)) {
            cout << "NIE" << en;
            return;
        }
        while (sz(ans) > n) ans.pop_back();
        cout << ans << en;
        return;
    } else if (k == 4) {
        dop();
        return;
    } else if (k == 5) {
        f(i, 0, 4) wyn += 'P';
        dop();
    } else {    
        f(i, 0, k) wyn += 'A';
        dop();
        return;
    }
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int q = 1;
    cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}