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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;

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

        if(k<=3){
            switch(k){
                case 1:
                    s = "AP";
                    max_n = 2;
                    break;
                case 2:
                    s = "AAPP";
                    max_n = 4;
                    break;
                case 3:
                    s = "AAAPAPPP";
                    max_n = 8;
                    break;
            }

            if(n<=max_n){
                cout << s.substr(0, n) << "\n";
            }else{
                cout << "NIE\n";
            }
            continue;
        }
        

        s = "PPAPAA";
        for(int i=0; i<k; i++){
            cout << "A";
        }

        for(int i=0; i<n-k; i++){
            cout << s[i%6];
        }
        cout << "\n";
    }
    

    return 0;
}