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
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;
#define ll long long

string Palindrom(int n, int k)
{
    string w;
    if (n == 7 and k == 3)
    {
        return "AAPAPPP";
    }
    if (n == 8 and k == 3)
    {
        return "AAAPAPPP";
    }
    if (k >= (n + 1) / 2)
    {
        for (int i = 0; i < n; i++)
        {
            if (i < k)
                w += 'P';
            else
                w += 'A';
        }
        return w;
    }
    else if (k < 4)
    {
        return "NIE";
    }
    else
    {
        for (int i = 0; i < k; i++)
        {
            w += 'P';
        }
        string b = "AAPAPP";
        for (int i = 0; i < n - k; i++)
        {
            w += b[i % 6];
        }
        return w;

    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
    {
        int n, k;
        cin >> n >> k;
        cout << Palindrom(n, k) << "\n";
    }
}