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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define vec vector
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

#define nare cout<<"NIE\n"; return;

bool is_pali(vi a){
	auto ra=a;
	reverse(all(ra));
	return a==ra;
}

vec<vi> f(10,vi(10,-1));

void gap(){
	for(int n=1;n<=8;n++){
		rep(msk,1<<n){
			int now=0;
			rep(i,n){
				vi b;
				rng(j,i,n){
					b.pb(msk>>j&1);
					if(is_pali(b)){
						now=max(now,j-i+1);
					}
				}
			}
			f[n][now]=msk;
		}
	}
}

void slv(){
	int n,k;
	cin>>n>>k;

	if(n<=8){
		int msk=f[n][k];
		if(msk<0){
			nare;
		}
		rep(i,n){
			cout<<(msk>>i&1?'A':'P');
		}
		cout<<"\n";
		return;
	}

	if(k<4){
		nare;
	}

	vi pat={1,1,0,1,0,0};
	vi a;
	rep(i,k) a.pb(0);
	rng(i,k,n) a.pb(pat[(i-k)%sz(pat)]);

	rep(i,n){
		cout<<(a[i]?'A':'P');
	}
	cout<<"\n";
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	gap();

	int t;
	t=1;
	cin>>t;

	rep(cs,t){
		slv();
	}
}