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
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false

string s = "PPAPAA";

void rozw () {
    int n, k;
    cin >> n >> k;

    if (k == 1) {
        if (n > 2) {
            cout << "NIE\n";
            return;
        }
        if (n == 1) {
            cout << "P\n";
            return;
        }
        if (n == 2) {
            cout << "PA\n";
            return;
        }
    }

    if (k == 2) {
        if (n > 4) {
            cout << "NIE\n";
            return;
        }
        if (n == 2) {
            cout << "PP\n";
            return;
        }
        if (n == 3) {
            cout << "PPA\n";
            return;
        }
        if (n == 4) {
            cout << "PPAA\n";
            return;
        }
    }

    if (k == 3) {
        if (n > 8) {
            cout << "NIE\n";
            return;
        }
        if (n == 3) {
            cout << "PPP\n";
            return;
        }
        if (n == 4) {
            cout << "PPPA\n";
            return;
        }
        if (n == 5) {
            cout << "PPPAA\n";
            return;
        }
        if (n == 6) {
            cout << "PPPAAA\n";
            return;
        }
        if (n == 7) {
            cout << "PPPAPAA\n";
            return;
        }
        if (n == 8) {
            cout << "PPPAPAAA\n";
            return;
        }
    }

    if (k >= 4) {
        for (int i = 0; i < k; i ++) {
            cout << "A";
        }
        int j = 0;
        for (int i = k; i < n; i ++) {
            cout << s[j];
            j ++;
            j %= 6;
        }
        cout << "\n";
    }
}

int main () {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t;
    cin >> t;

    while (t --) {
        rozw();
    }

    return 0;
}