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
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


void solve() {
    int n, k;
    cin >> n >> k;
    if (k * 2 >= n) {
        REP(i, k)
            cout << "P";
        REP(i, n - k)
            cout << "A";
        cout << '\n';
        return;
    }
    if (n == 7 && k == 3) {
        cout << "PPPAPAA\n";
        return;
    }
    if (n == 8 && k == 3) {
        cout << "PPPAPAAA\n";
        return;
    }
    if (k <= 3) {
        cout << "NIE\n";
        return;
    }

    string rec = "PPAPAA";
    if (k == 5) {
        int start = 6 - n % 6;
        FOR(i, start, 5) {
            cout << rec[i];
            n--;
        }
        REP(i, n / 6 - 1)
            cout << rec.data();
        cout << "PPAPAP\n";
        return;
    }

    rec = "AAPPAP";
    n -= k;
    int start = 6 - n % 6;
    FOR(i, start, 5) {
        cout << rec[i];
        n--;
    }
    REP(i, n / 6)
        cout << rec.data();
    cout << "AA";
    REP(i, k - 4)
        cout << "P";
    cout << "AA\n";
}


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

    int q;
    cin >> q;
    while (q--)
        solve();

    return 0;
}