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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) <<
'\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif

string pattern = "PAAPAP";
vector<string> small = {"AP", "AAPP", "AAAPAPPP"};

void solve(){
    int n, k; cin >> n >> k;
    if(k > n){
        cout << "NIE\n";
        return;
    }
    if(k <= 3){
        if(n > small[k-1].length()){
            cout << "NIE\n";
        }else{
            rep(i, n)cout << small[k-1][i];
            cout << "\n";
        }
    }else if(k == 4){
        rep(i, n){
            cout << pattern[i % 6];
        }
        cout << "\n";
    }else if(k == 5){
        cout << "PPPP";
        rep(i, n - 4)cout << pattern[i % 6];
        cout << "\n";
    }else{
        rep(i, k)cout<< 'A';
        rep(i, n - k)cout << pattern[i % 6];
        cout << "\n";
    }
}

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