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
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <stack>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int MAXN=1000000+11;
int t;
int n, k;
char p3[] = {'A','A','A','P','A','P','P','P'};
char p4[] = {'P','A','P','P','A','A'};

void solve() {
    cin >> n >> k;
    if (k==1) {
        if (n > 2) {
            cout << "NIE\n";
        } else {
            cout << "P";
            if (n==2) {
                cout << "A";
            }
            cout << "\n";
        }
    } else if (k==2) {
        if (n > 4) {
            cout << "NIE\n";
        } else {
            cout << "PP";
            if (n==3) {
                cout << "A";
            }
            if (n==4) {
                cout << "AA";
            }
            cout << "\n";
        }
    } else if (k==3) {
        if (n > 8) {
            cout << "NIE\n";
        } else {
            REP(i, n) {
                cout << p3[i];
            }
            cout << "\n";
        }
    } else {
        REP(i, k) {
            cout << 'A';
        }
        REP(i, n-k) {
            cout << p4[i%6];
        }
        cout << "\n";
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin >> t;
    REP(ti, t) {
        solve();
    }
    return 0;
}