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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 22, mod = 1'000'000'007;

std::string general(int n, int k)
{
	std::string ret (k-1, 'P');
	while (SZ(ret) < n)
		ret += "PAAPAP";
	ret.resize(n);
	return ret;
}

void solve()
{
	int n, k;
	scanf ("%d%d", &n, &k);
	
	std::string smal[4] = { "", "AP", "AAPP", "PPPAPAAA" };
	std::string res = "NIE";
	if (k < 4)
	{
		if (n <= SZ(smal[k]))
			res = smal[k].substr(0, n);

	}
	else
		res = general(n, k);

	printf("%s\n", res.c_str());
}

int main()
{
	int tc = 1;
	scanf ("%d", &tc);

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}