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
#include <bits/stdc++.h>
#include <bitset>
#define rep(i, p, k) for (int i = (p); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define fi first
#define sc second
#ifndef DEBUG
#define debug(...)
#else
#include "debug.h"
#endif
using namespace std;
const char C[] = "AAPPAP";
const int L = 6;

string solve() {
  int n, k;
  cin >> n >> k;
  if (k == 1) {
    if (n == 1)
      return "A";
    if (n == 2)
      return "AP";
    return "NIE";
  }
  if (k == 2) {
    if (n == 2)
      return "AA";
    if (n == 3)
      return "AAP";
    if (n == 4)
      return "AAPP";
    return "NIE";
  }
  if (k == 3) {
    if (n == 3)
      return "AAA";
    if (n == 4)
      return "AAAP";
    if (n == 5)
      return "AAAPP";
    if (n == 6)
      return "AAAPPP";
    if (n == 7)
      return "AAAPAPP";
    if (n == 8)
      return "AAAPAPPP";
    return "NIE";
  }
  string r; r.reserve(n);
  rep(i,0,k-2) r += 'A';
  rep(i,0,n-k+2) r += C[i % L];
  return r;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int Z;
  cin >> Z;
  while (Z--)
    cout << solve() << '\n';
}