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
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n = 18, k;
int tab[1000007];
int limit[] = {0, 2, 4, 8};
string str[] = {"", "PA", "PPAA", "PPPAPAAA", "PAPPAA"};
/*
int palin(int mask, int p, int k)
{
    //cout << "czy palin " << p << " do " << k << '\n';
    while(p < k)
    {
        if(((mask >> p) & 1) != ((mask >> k) & 1))
            return 0;
        p++;
        k--;
    }
    return 1;
}

int longest_pal(int mask)
{
    int res = 0;
    FOR(i, 0, n-1)
        FOR(j, i, n-1)
            if(palin(mask, i, j))
                res = max(res, j-i+1);
    return res;
}

int solve_old()
{
    cin >> n >> k;

    int minn = n, best = 0;
    forr(i, 1<<n)
    {
        int x = longest_pal(i);
        if(x < minn)
        {
            minn = x;
            best = i;
        }
    }
    printf("n = %d - dl: %d, best: %b\n", n, minn, best);


    return 0;
}
*/
int solve()
{
    cin >> n >> k;

    if(k < 4)
    {
        if(n > limit[k])
            cout << "NIE" << '\n';
        else
            cout << str[k].substr(0, n) << '\n';
    }
    else
    {
        forr(i, k)
            cout << "A";
        forr(i, n-k)
            cout << str[4][i%6];
        cout << '\n';
    }
    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    //cout << longest_pal(54093) << endl;

    testy()
        solve();

    return 0;
}