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 <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 1000010;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

int n, k;

string res[6] = {
	"NIE\n",
	"PA",
	"PPAA",
	"PPPAPAAA",
	"",
	"",
};

int a[6] = {0, 2, 4, 8, MXN, MXN};

void test() {
	scanf("%d %d", &n, &k);
	a[4] = n;
	if(k <= 4) {
		if(n <= a[k])
			cout<<res[k].substr(0, n)<<"\n";
		else
			cout<<"NIE\n";
	}
	else {
		FOR(i, 1, k)
			cout<<"A";
		cout<<res[5].substr(0, n - k)<<endl;
	}
}

void preproc() {
	while(res[4].length() < MXN)
		res[4] += "PAAPPA";
	while(res[5].length() < MXN)
		res[5] += "PPAPAA";
}

int main() {
	preproc();
	int te = 1;
	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}