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
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; ++i)
#define RFOR(i, a, b) for(int i = (int)a; i >= (int)b; --i)
#define in insert
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
using namespace std;

void solve() {
    int n, k; cin >> n >> k;
    string pat = "APAAPP";
    string pat2 = "APAAA";
    int wlk = pat.size();
    if(k == 1 && n > 2) {cout << "NIE\n"; return;}
    else if(k == 1) {
        cout << 'P';
        FOR(i, 1, n - k) cout << 'A';
        cout << '\n';
        return;
    }
    if(k == 2 && n > 4) {cout << "NIE\n"; return;}
    else if(k == 2) {
        cout << "PP";
        FOR(i, 1, n - k) cout << 'A';
        cout << '\n';
        return;
    }
    if(k == 3 && n > 8) {cout << "NIE\n"; return;}
    else if(k == 3) {
        cout << "PPP";
        FOR(i, 0, n - k - 1) cout << pat2[i % wlk];
        cout << '\n';
        return;
    }
    FOR(i, 1, k) cout << 'P';
    FOR(i, 0, n - k - 1) cout << pat[i % wlk];
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t; cin >> t; while(t--) solve();
    return 0;
}