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

const long long MAX_VAL = 1000000007;

bool palindrome(string s, int from, int to) {
    while(from <= to) {
        if(s[from] != s[to]) {
            return false;
        }
        from++;
        to--;
    }
    return true;
}

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

    int t;
    cin >> t;

    for(int i = 0; i < t; i++) {
        int n, k;
        cin >> n >> k;

        if(k == 1) {
            if(n == 1) {
                cout << "A\n";
            } else if(n == 2) {
                cout << "AP\n";
            } else {
                cout << "NIE\n";
            }
            continue;
        }

        if(k == 2) {
            if(n == 2) {
                cout << "AA\n";
            } else if(n == 3) {
                cout << "AAP\n";
            } else if(n == 4) {
                cout << "AAPP\n";
            } else {
                cout << "NIE\n";
            }
            continue;
        }

        if(k*2 >= n) {
            string res(k, 'A');
            for(int j=k; j<n; j++) {
                res += 'P';
            }
            cout<<res<<"\n";
            continue;
        }

        string result(n, 'A');

        for(int j = k; j < n; j++) {
            bool A = false;
            bool P = false;
            result[j] = 'A';
            if(!palindrome(result, j - k, j)) {
                if(j - k - 1 > 0) {
                    if(!palindrome(result, j - k - 1, j)) {
                        A = true;
                    }
                } else {
                    A = true;
                }
            }

            if(!A) {
                result[j] = 'P';
                if(!palindrome(result, j - k, j)) {
                    if(j - k - 1 > 0) {
                        if(!palindrome(result, j - k - 1, j)) {
                            P = true;
                        }
                    } else {
                        P = true;
                    }
                }

                if(!P) {
                    result = "NIE";
                    break;
                }
            }
        }

        cout << result << "\n";
    }

    return 0;
}