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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#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 VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int


#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; }
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}


#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue


#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));


using namespace std;

char s2[] = {'A','P'};

char cyc[] = {'A','A','P','A','P','P'};

char xxx[] = "AAAPAPPP"; 

bool is_pal(VI& w, int a, int b) {
	for (int i=a, j=b; i <= b; i++,j--) {
		if (w[i] != w[j]) return false;	
	}
	return true;
}

void brut(int n) {
	set<int> wyn;
	for (int i = 0; i < (1<<n); i++) {
		VI w;
		for (int j=0; j < n; j++) {
			if (i & (1<<j)) w.pb(1);
			else w.pb(0);
		}
		int best = 0;
		for (int i =0; i < n; i++) {
			for (int j = i; j < n;j++) {
				if (is_pal(w,i,j)) best = max(best, j-i+1);
			}
		}
		if (best == 3) debugv(w);
		wyn.insert(best);
	}
	debugv(wyn);
}

void solve() {
	make2(n, k);
	if (k + k >= n) {
		for (int i = 0; i < k; i++) printf("A");
		for (int i = k; i < n; i++) printf("P");
		printf("\n");
		return;
	}
	if (k == 1) {
		printf("NIE\n");
		return;
	}
	if (k == 2) {
		printf("NIE\n");
		return;
	}
	if (k == 3) {
		if (n <= 8) {
			for (int i = 0; i < n; i++) {
				printf("%c", xxx[i]);
			}
			printf("\n");
			return;
		} else {
			printf("NIE\n");
		}
		return;
	}
	if (k >= 4) {
		for (int i = 0 ; i < k; i++) {
			printf("P");
		}
		for (int i = k; i < n; i++) {
			printf("%c", cyc[(i-k)%6]);
		}
		printf("\n");
	}
}

int main() {
	/*FOR(n,4,12) {
		debug(n);
		brut(n);
	}*/
	make(z);
	while (z--) {
		solve();
	}
}