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

using namespace std;

int t;
int n, k;

// 3
// PPP APA AA

// 4
// APPA (PAAPAP)(PAAPAP)P

string tail_gen = "PAAPAP";

void solve() {
	cin >> n >> k;
	if (k == 1) {
		if (n == 1) cout << "P\n";
		else if (n == 2) cout << "PA\n";
		else cout << "NIE\n";
		return;
	}
	else if (k == 2) {
		if (n == 2) cout << "PP\n";
		else if (n == 3) cout << "PPA\n";
		else if (n == 4) cout << "PPAA\n";
		else cout << "NIE\n";
		return;
	}
	else if (k == 3) {
		if (n == 3) cout << "PPP\n";
		else if (n == 4) cout << "PPPA\n";
		else if (n == 5) cout << "PPPAA\n";
		else if (n == 6) cout << "PPPAAA\n";
		else if (n == 7) cout << "PPAPAAA\n";
		else if (n == 8) cout << "PPPAPAAA\n";
        else cout << "NIE\n";
		return;
	}
    else if (k == 4) {
        int tail_len = n;
        while (tail_len > tail_gen.size()) {
            cout << tail_gen;
            tail_len -= tail_gen.size();	
        }
        cout << tail_gen.substr(0, tail_len) << '\n';
        return;
    }
    else if (k == 5) {
        cout << "PPPP";
        int tail_len = n - 4;
        while (tail_len > tail_gen.size()) {
            cout << tail_gen;
            tail_len -= tail_gen.size();	
        }
        cout << tail_gen.substr(0, tail_len) << '\n';
        return;
    }
	for (int i = 0; i < k; ++i) cout << 'A';
	
	int tail_len = n - k;
	while (tail_len > tail_gen.size()) {
		cout << tail_gen;
		tail_len -= tail_gen.size();	
	}
	cout << tail_gen.substr(0, tail_len) << '\n';
}

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

    while (t--) solve();
    return 0;
}