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
#!/usr/bin/env python3

def TryGetPrefix(s, n):
    if n <= len(s):
        return s[:n]
    else:
        return None

def Solve(n, k):
    if k == 1:
        return TryGetPrefix("PA", n)
    elif k == 2:
        return TryGetPrefix("PPAA", n)
    elif k == 3:
        return TryGetPrefix("PPPAPAAA", n)
    else:
        s = "P" * (k - 2) + "PPAAPA" * (n // 6 + 1)
        return s[:n]


t = int(input())

for tidx in range(t):
    n, k = map(int, input().split())
    ans = Solve(n, k) or "NIE"
    print(ans)