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
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const string per = "APPAAP";
const int bnd = 8;
string v[bnd + 1][bnd + 1];

void solve() {
  int n, k;
  cin >> n >> k;
  
  if(n <= bnd) {
    if(v[n][k].length()) cout << v[n][k] << '\n';
    else cout << "NIE\n";
  } else {
    if(k < 4) {
      cout << "NIE\n";
      return;
    } else if(k == 4) k = 0;
    
    string res(k, 'P');
    int i = 0;
    while(res.length() < n) {
      res += per[i++];
      if(i == per.length()) i = 0;
    }
    cout << res << '\n';
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  
  for(int n = 1; n <= bnd; n++) {
    for(int msk = 0; msk < (1 << n); msk++) {
      string s;
      for(int i = 0; i < n; i++) {
        if(msk & (1 << i)) s += 'A';
        else s += 'P';
      }
      int mx = 0;
      for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
          bool f = 1;
          for(int k = i; k <= j; k++) {
            if(s[k] != s[j - k + i]) {
              f = 0;
              break;
            }
          }
          if(f) mx = max(mx, j - i + 1);
        }
      }
      v[n][mx] = s;
    }
  }

  int t;
  cin >> t;
  while(t--) solve();
}