Problem: Carl has n coins of various colors, and he would like to sort them into piles. The coins are labeled 1,2,…,n, and each coin is exactly one of red, green, or blue. He would like to sort the coins into three different piles so one pile contains all red coins, one pile contains all green coins, and one pile contains all blue coins.

Unfortunately, Carl is colorblind, so this task is impossible for him. Luckily, he has a friend who can take a pair of coins and tell Carl if they are the same color or not. Using his friend, Carl believes he can now sort the coins. The order of the piles doesn't matter, as long as all same colored coins are in the one pile, and no two different colored coins are in the same pile.

His friend will answer questions about multiple pairs of coins in batches, and will answer about all of those pairs in parallel. Each coin should be in at most one pair in each batch. The same coin can appear in different batches.

Carl can use only 7 batches. Help him find the piles of coins after sorting.

Interaction

You will be given multiple test cases. The first line contains an integer t (1 ≤ t ≤ 5) — the number of test cases.

The first line of each test case contains one integer n (1 ≤ n ≤ 10^5) — the number of coins. If you read in a value of -1 here, that means that you printed an invalid answer in the previous case and exit immediately to avoid getting other verdicts.

To ask a question, print "Q k\ x_1\ y_1\ …\ x_k\ y_k" (1 ≤ k ≤ n/2, 1 ≤ x_i,y_i ≤ n, x_i ≠ y_i). k denotes the number of pairs in the batch, and x_i, y_i denote the i-th pair of coins in the batch. A coin can only appear at most once in a batch. All x_i and y_i should be distinct.

The judge will respond with a bitstring of length k, where the i-th character is "1" if x_i and y_i are the same color, and "0" otherwise. The judge will respond with -1 if you ever ask an invalid query. Make sure to exit immediately to avoid getting other verdicts.

When you are ready to answer, print four lines.

The first line contains "A k_1\ k_2\ k_3" (0 ≤ k_1,k_2,k_3 and k_1+k_2+k_3 = n). These denote the sizes of the three piles.

The next line has k_1 integers, the labels of the coins in the first pile.

The next line has k_2 integers, the labels of the coins in the second pile.

The next line has k_3 integers, the labels coins in the third pile.

Each coin must appear in exactly one pile.

You may only ask at most 7 batches per test case.

After printing a query and the answer do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



Hack Format

To hack, use the following format. Note that you can only hack with one test case.

The first line should contain a single integer t (t=1).

The second line should contain a single string s consisting of only the characters "R", "G", "B" (1 ≤ |s| ≤ 10^5). The i-th character in this string represents the color of the i-th coin.

Example

Input


3
3
1
1
1
3
1
0
0
6
000
010
100
001
000


Output


Q 1 1 2
Q 1 2 3
Q 1 1 3
A 3 0 0
1 2 3


Q 1 1 3
Q 1 2 3
Q 1 1 2
A 2 0 1
1 3

2
Q 3 1 2 3 4 5 6
Q 3 1 3 2 5 4 6
Q 3 1 4 2 6 3 5
Q 3 1 5 2 4 3 6
Q 3 1 6 2 3 4 5
A 2 2 2
1 4
2 5
3 6

Note

In the example, there are three test cases.

In the first test case, there are three coins. We ask about the pairs (1,2), (2,3), and (1,3) in different batches and get that they are all the same color. Thus, we know all the coins are the same color, so we can put them all in one pile. Note that some piles can be empty and those are denoted with an empty line.

In the second test case, there are three coins again. This time, we only get that (1,3) are the same and (1,2) and (2,3) are different. So, one possible scenario is that coins 1 and 3 are red and coin 2 is green.

In the last case, there are 6 coins. The case shows how to ask and receive answers for multiple pairs in one batch.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N], belong[N];
char s[4][N >> 1];
int c[2][N], num[2];
void query(int *a, int n, char *s1, char *s2) {
  if (n < 2) return;
  printf("Q %d", n >> 1);
  for (int i = 1; i < n; i += 2) printf(" %d %d", a[i], a[i + 1]);
  putchar('\n');
  fflush(stdout);
  scanf("%s", s1 + 1);
  if (n < 3) return;
  printf("Q %d", (n - 1) >> 1);
  for (int i = 2; i < n; i += 2) printf(" %d %d", a[i], a[i + 1]);
  putchar('\n');
  fflush(stdout);
  scanf("%s", s2 + 1);
}
void query2() {
  int c1 = num[0] >> 1;
  int c2 = num[1] >> 1;
  int cnt = c1 + c2;
  if (!cnt) return;
  printf("Q %d", cnt);
  for (int k = 0; k < 2; ++k)
    for (int i = 1; i < num[k]; i += 2) printf(" %d %d", c[k][i], c[k][i + 1]);
  putchar('\n');
  fflush(stdout);
  scanf("%s", s[0] + 1);
  for (int i = 1; i <= c2; ++i) s[2][i] = s[0][c1 + i];
  s[0][c1 + 1] = s[2][c2 + 1] = 0;
  c1 = (num[0] - 1) >> 1;
  c2 = (num[1] - 1) >> 1;
  cnt = c1 + c2;
  if (!cnt) return;
  printf("Q %d", cnt);
  for (int k = 0; k < 2; ++k)
    for (int i = 2; i < num[k]; i += 2) printf(" %d %d", c[k][i], c[k][i + 1]);
  putchar('\n');
  fflush(stdout);
  scanf("%s", s[1] + 1);
  for (int i = 1; i <= c2; ++i) s[3][i] = s[1][c1 + i];
  s[1][c1 + 1] = s[3][c2 + 1] = 0;
}
void print() {
  int cnt[3] = {};
  for (int i = 1; i <= n; ++i) ++cnt[a[i]];
  printf("A %d %d %d\n", cnt[0], cnt[1], cnt[2]);
  for (int i = 0; i < 3; ++i) {
    for (int j = 1; j <= n; ++j)
      if (a[j] == i) printf("%d ", j);
    putchar('\n');
  }
  fflush(stdout);
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    if (n == -1) return 0;
    for (int i = 1; i <= n; ++i) a[i] = i;
    query(a, n, s[0], s[1]);
    a[0] = -1;
    a[1] = 0;
    for (int i = 2; i <= n; ++i)
      a[i] = s[i & 1][i >> 1] == '1' ? a[i - 1] : a[i - 1] ^ 1;
    num[0] = num[1] = 0;
    for (int i = 1; i <= n; ++i) {
      if (a[i] != a[i - 1]) {
        c[a[i]][++num[a[i]]] = i;
        belong[i] = i;
      } else
        belong[i] = belong[i - 1];
    }
    assert(num[0] == num[1] || num[0] == num[1] + 1);
    query2();
    for (int i = 2; i <= num[0]; ++i)
      for (int j = 0; j < 2; ++j)
        if (i <= num[j])
          a[c[j][i]] =
              s[j << 1 | i & 1][i >> 1] == '1'
                  ? a[c[j][i - 1]]
                  : 3 - a[c[j][i - 1]] - (j ? a[c[0][i]] : a[c[1][i - 1]]);
    for (int i = 1; i <= n; ++i) a[i] = a[belong[i]];
    print();
  }
  return 0;
}