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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<long long,long long>
using namespace std;
using ll = long long;
using ld = long double;

constexpr int SIZE = 1;

int tab[9][9];

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

    if (n <= 8){
        if (!tab[n][k]){
            cout << "NIE\n";
            return;
        }

        for (int i=0; i<n; i++) cout << ((tab[n][k] & (1<<i)) ? 'A' : 'P');
        cout << '\n';
        return;
    }
    
    if (k<4){
        cout << "NIE\n";
        return;
    }


    for (int i=0; i<k; i++) cout << 'P';
    for (int i=0; i<n-k; i++) cout << ((i%6 == 0 || i%6 == 1 || i%6 == 3) ? 'A' : 'P');
    cout << '\n';

    return;
}
/*

int longestBitPalindrome(int x, int k)
{
    std::vector<int> bits(k);

    // wyciągamy k najmłodszych bitów
    for (int i = 0; i < k; ++i)
        bits[i] = (x >> i) & 1;

    int best = 0;

    // sprawdzamy wszystkie przedziały [l, r]
    for (int l = 0; l < k; ++l)
    {
        for (int r = l; r < k; ++r)
        {
            bool palindrome = true;

            int i = l, j = r;
            while (i < j)
            {
                if (bits[i] != bits[j])
                {
                    palindrome = false;
                    break;
                }
                ++i;
                --j;
            }

            if (palindrome)
                best = std::max(best, r - l + 1);
        }
    }

    return best;
}

void SOLVE1(){
    for (int n=1; n<=8; n++){
        int lim = 1<<n;
        
        for (int m=0; m<lim; m++){
            int res = longestBitPalindrome(m, n);
            tab[n][res] = m;
        }

    }

    

    for (int n=1; n<=8; n++){
        for (int k=1; k<=n; k++){
            cout << "   tab["<<n<<"]["<<k<<"] = "<<tab[n][k]<<";\n";
        }
    }
}*/

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

    tab[1][1] = 1;
    tab[2][1] = 2;
    tab[2][2] = 3;
    tab[3][1] = 0;
    tab[3][2] = 6;
    tab[3][3] = 7;
    tab[4][1] = 0;
    tab[4][2] = 12;
    tab[4][3] = 14;
    tab[4][4] = 15;
    tab[5][1] = 0;
    tab[5][2] = 0;
    tab[5][3] = 29;
    tab[5][4] = 30;
    tab[5][5] = 31;
    tab[6][1] = 0;
    tab[6][2] = 0;
    tab[6][3] = 58;
    tab[6][4] = 61;
    tab[6][5] = 62;
    tab[6][6] = 63;
    tab[7][1] = 0;
    tab[7][2] = 0;
    tab[7][3] = 116;
    tab[7][4] = 122;
    tab[7][5] = 125;
    tab[7][6] = 126;
    tab[7][7] = 127;
    tab[8][1] = 0;
    tab[8][2] = 0;
    tab[8][3] = 232;
    tab[8][4] = 244;
    tab[8][5] = 251;
    tab[8][6] = 253;
    tab[8][7] = 254;
    tab[8][8] = 255;

    int t;
    cin >> t;
    while (t--) SOLVE();

return 0;}