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
95
96
97
98
99
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
ostream& operator<< (ostream& os, const vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}
template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    for(auto& p : vec) is >> p;
    return is;
}

bool ispal(vi& V, int b, int n) {
	FOR(i,0,n / 2) if (V[b + i] != V[b + n - i - 1]) return false;
	return true;
}

int longpal(vi& V){
	FORD(n,V.size(),1){
		FOR(p,0,V.size() - n + 1) {
			if (ispal(V, p, n)) return n;
		}
	}
	return -1;
}

void discov(int n, int k) {
	vi pom(n);
	FOR(i,0,(1 << n)) {
		int icp = i;
		FOR(i,0,n) {
			pom[i] = icp % 2;
			icp /= 2;
		}
		int v = longpal(pom);
		if (v == k) {
			FOR(ii,0,n) cout << "AP"[pom[ii]];
			cout << endl;
			return;
		}
	}
	cout << "NIE" << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
		int n, k;
		cin >> n >> k;
		if (n <= 8) {
			discov(n, k);
			continue;
		}
		if (k < 4) {
			cout << "NIE" << endl;
			continue;
		}
		FOR(i,0,k) cout << "A";
		string pom = "PAPPAAPAPPAA";
		FOR(i,k,n) cout << pom[(i - k) % pom.size()];
		cout << endl;
	}
}