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
#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

string odp[9][9];

void solve() {
  int n,k;
  cin >> n >> k;
  if (n < 9) {
    cout << odp[n][k] << '\n';
  } else {
    string xd = "AAPAPP";
    if (k < 4) {
      cout << "NIE\n";
      return;
    }
    rep(i, 0, k - 2) cout << 'A';
    rep(j, 0, n - (k - 2)) cout << xd[j % sz(xd)];
    cout << '\n';
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  rep(n, 1, 9) rep(k, 1, 9) odp[n][k] = "NIE\n";
  rep(n, 1, 9) {
    rep(msk, 0, 1 << n) {
      int m = msk;
      vi a(n);
      rep(i, 0, n) a[i] = m % 2, m /= 2;
      int mx = 0;
      rep(i, 0, n) rep(j, i, n) {
        bool tu = 1;
        rep(k, 0, j - i + 1) tu &= a[i + k] == a[j - k];
        if (tu) mx = max(mx, j - i + 1);
      }
      string s(n, '.');
      rep(i, 0, n) s[i] = a[i] ? 'P' : 'A';
      odp[n][mx] = s;
    }
  }
  int t;
  cin >> t;
  while (t--) solve();
}