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

using namespace std;

#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(...) {}
#endif

#define x first
#define y second
#define ir(x, a, b) ((a) <= (x) && (x) <= (b))
#define vec vector
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)((x).size()))

using ll = long long;

using pii = pair<ll, ll>;

bool palindrome(vec<bool>& a, int i, int j) {
  if (i < 0) return false;
  if (j < i) return true;
  return a[i] == a[j] && palindrome(a, i+1, j-1);
}

vec<bool> brute(int d, int sz) {
  vec<bool> a(d);
  for (int i = d; a.size() < sz; i++) {
    debug(a);
    vec<bool> poss(2,1);
    debug(i-d, i-1);
    if (palindrome(a, i-d, i-1) && i-d-1 >= 0) {
      poss[a[i-d-1]] = false;
    }
    if (palindrome(a, i-d+1, i-1) && i-d >= 0) {
      poss[a[i-d]] = false;
    }
    debug(poss);
    if (poss[0]) {
      a.push_back(0);
      continue;
    }
    if (poss[1]) {
      a.push_back(1);
      continue;
    }
    return a;
  }
  debug(a);
  return a;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T; cin >> T;
  while (T--) {
    int N, K; cin >> N >> K;
    if (K >= 4) {
      vec<bool> a = brute(4, N-K+4);
      rep (k, 0, K) {
        cout << 'A';
      }
      string s = "PAPPAA";
      rep (i, 0, N-K) {
        cout << s[i % 6];
      }
      cout << "\n";
    } else {
      vec<bool> a = brute(K, N);
      if (a.size() < N) {
        cout << "NIE\n";
        continue;
      }
      for (auto x : a) {
        cout << (x ? 'P' : 'A');
      }
      cout << "\n";
    }
  }
  return 0;
}