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

string ans;

void solve(int n, int k, const string& s) {
    int max_sz = 0;
    for(int i = 0; i < n; ++i) {
        for(int j = 1; j <= n; ++j) {
            int cur_sz = 1 + (j - 1) * 2;
            if(i - j < 0 || i + j >= n) {
                max_sz = max(max_sz, cur_sz);
                break;
            }

            if(s[i - j] != s[i + j]) {
                max_sz = max(max_sz, cur_sz);
                break;
            }
        }

        if(i != n - 1 && s[i] == s[i + 1]) {
            for(int j = 1; j <= n; ++j) {
                int cur_sz = 2 + (j - 1) * 2;
                if(i - j < 0 || i + 1 + j >= n) {
                    max_sz = max(max_sz, cur_sz);
                    break;
                }
                if(s[i - j] != s[i + 1 + j]) {
                    max_sz = max(max_sz, cur_sz);
                    break;
                }
            }
        }
    }

    if(max_sz == k) {
        ans = s;
    }
}

void rec(int n, int k, string& cur) {
    if((int)cur.size() == n) {
        solve(n, k, cur);

        return;
    }

    cur.push_back('A');
    rec(n, k, cur);
    cur.pop_back();

    cur.push_back('P');
    rec(n, k, cur);
    cur.pop_back();
}

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

    int t;
    cin >> t;
    while(t--) {
        int n, k;
        cin >> n >> k;

        string pattern = "APAAPP";

        if(k >= 4) {
            for(int i = 0; i < k; ++i) {
                cout << 'P';
            }
            int zostalo = n - k;
            for(int i = 0; i < zostalo; ++i) {
                int idx = i % 6;
                cout << pattern[idx];
            }
            cout << '\n';
        }
        else if(k == 3) {
            if(n >= 9) {
                cout << "NIE\n";
            }
            else {
                string tmp;
                rec(n, k, tmp);

                cout << ans << '\n';
                ans = "";
            }
        }
        else if(k == 2) {
            if(n >= 5) {
                cout << "NIE\n";
            }
            else {
                string tmp;
                rec(n, k, tmp);

                cout << ans << '\n';
                ans = "";
            }
        }
        else {
            if(n >= 3) {
                cout << "NIE\n";
            }
            else if(n == 2) {
                cout << "PA\n";
            }
            else {
                cout << "P\n";
            }
        }
    }
}