Problem: Note that the only difference between the easy and hard version is the constraint on the number of queries. You can make hacks only if all versions of the problem are solved.

This is an interactive problem.

You are given a tree consisting of n nodes numbered with integers from 1 to n. Ayush and Ashish chose two secret distinct nodes in the tree. You need to find out both the nodes. You can make the following query: 

  * Provide a list of nodes and you will receive a node from that list whose sum of distances to both the hidden nodes is minimal (if there are multiple such nodes in the list, you will receive any one of them). You will also get the sum of distances of that node to the hidden nodes. 



Recall that a tree is a connected graph without cycles. The distance between two nodes is defined as the number of edges in the simple path between them.

More formally, let's define two hidden nodes as s and f. In one query you can provide the set of nodes \\{a_1, a_2, …, a_c\} of the tree. As a result, you will get two numbers a_i and dist(a_i, s) + dist(a_i, f). The node a_i is any node from the provided set, for which the number dist(a_i, s) + dist(a_i, f) is minimal.

You can ask no more than 14 queries.

Input

The first line contains a single integer t (1 ≤ t ≤ 10) — the number of test cases. Please note, how the interaction process is organized.

The first line of each test case consists of a single integer n (2 ≤ n ≤ 1000) — the number of nodes in the tree.

The next n - 1 lines consist of two integers u, v (1 ≤ u, v ≤ n, u ≠ v) — the edges of the tree.

Interaction

To ask a query print a single line: 

  * In the beginning print "? c " (without quotes) where c (1 ≤ c ≤ n) denotes the number of nodes being queried, followed by c distinct integers in the range [1, n] — the indices of nodes from the list. 



For each query, you will receive two integers x, d — the node (among the queried nodes) with the minimum sum of distances to the hidden nodes and the sum of distances from that node to the hidden nodes. If the subset of nodes queried is invalid or you exceeded the number of queries then you will get x = d = -1. In this case, you should terminate the program immediately.

When you have guessed the hidden nodes, print a single line "! " (without quotes), followed by two integers in the range [1, n] — the hidden nodes. You can output the hidden nodes in any order.

After this, you should read a string. If you guess the nodes correctly, you will receive the string "Correct". In this case, you should continue solving the remaining test cases or terminate the program, if all test cases were solved. Otherwise, you will receive the string "Incorrect". In this case, you should terminate the program immediately.

Guessing the hidden nodes does not count towards the number of queries asked.

The interactor is not adaptive. The hidden nodes do not change with queries.

Do not forget to read the string "Correct" / "Incorrect" after guessing the hidden nodes.

You need to solve each test case before receiving the input for the next test case.

The limit of 14 queries applies to each test case and not to the entire input.

After printing a query do not forget to output the end of the 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 the documentation for other languages.



Hacks

To hack the solution, use the following test format:

The first line should contain a single integer t (1 ≤ t ≤ 10) — the number of test cases. The description of the test cases follows.

The first line of each test case should contain a single integer n (2 ≤ n ≤ 1000) — the number of nodes in the tree. The second line should contain two distinct integers in the range [1, n] — the hidden nodes. The next n - 1 lines should contain two integers u, v (1 ≤ u, v ≤ n, u ≠ v) — the edges of the tree.

Example

Input


1
3
1 2
1 3

1 1

2 3

3 1

3 1

Correct

Output


? 1 1

? 1 2

? 1 3

? 2 2 3

! 1 3

Note

The tree from the first test is shown below, and the hidden nodes are 1 and 3.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
std::mt19937 rng(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
long long mod = (1000000007LL);
inline long long Mod(long long a, long long b) { return (a % b); }
inline long long poww(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b) {
    a %= b, swap(a, b);
  }
  return a;
}
void read(vector<int> &w, int n) {
  w.resize(n);
  for (int i = 0; i < n; i++) cin >> w[i];
}
void print(vector<int> &w) {
  for (int i = 0; i < (int)(w).size(); i++) {
    if (i == (int)(w).size() - 1)
      cout << w[i] << "\n";
    else
      cout << w[i] << " ";
  }
}
int prodmod(vector<int> w);
int summod(vector<int> w);
vector<int> grafo[300050];
pair<int, int> query(vector<int> val) {
  if ((int)(val).size() == 0) return {-1, -1};
  cout << "? " << (int)(val).size() << " ";
  for (auto x : val) cout << x << " ";
  cout << endl;
  int a, b;
  cin >> a >> b;
  return {a, b};
}
void dfs(int x, int p, vector<int> &tam, vector<int> &deep) {
  tam[x] = 1;
  deep[x] = deep[p] + 1;
  for (auto v : grafo[x]) {
    if (v == p) continue;
    dfs(v, x, tam, deep);
    tam[x] += tam[v];
  }
}
void dfs2(int x, int p, vector<int> &good) {
  good.push_back(x);
  for (auto v : grafo[x]) {
    if (v != p) dfs2(v, x, good);
  }
}
void dfs3(int x, int p, vector<int> &deep) {
  deep[x] = deep[p] + 1;
  for (auto v : grafo[x]) {
    if (v == p) continue;
    dfs3(v, x, deep);
  }
}
int32_t main() {
  int q;
  cin >> q;
  while (q--) {
    int n;
    cin >> n;
    vector<int> caras, tam(n + 1), deep(n + 1);
    for (int i = 1; i <= n; i++) grafo[i].clear(), caras.push_back(i);
    for (int i = 1; i < n; i++) {
      int a, b;
      cin >> a >> b;
      grafo[a].push_back(b);
      grafo[b].push_back(a);
    }
    auto A = query(caras);
    int root = A.first, dist = A.second;
    dfs(root, root, tam, deep);
    vector<int> good;
    pair<int, int> opt = {-1, -1};
    good.push_back(root);
    for (auto v : grafo[root]) opt = max(opt, {tam[v], v});
    for (auto v : grafo[root]) {
      if (v == opt.second) continue;
      dfs2(v, root, good);
    }
    sort(begin(good), end(good),
         [&](int a, int b) { return deep[a] > deep[b]; });
    int ini = 0, fim = (int)(good).size() - 1, mid, best = -1;
    while (fim >= ini) {
      mid = (ini + fim) / 2;
      vector<int> subset;
      for (int i = 0; i <= mid; i++) subset.push_back(good[i]);
      pair<int, int> curr = query(subset);
      if (curr.second == dist) {
        best = mid;
        fim = mid - 1;
      } else
        ini = mid + 1;
    }
    if (best == -1) cout << "WA\n", exit(0);
    int L = good[best];
    vector<int> deep2(n + 1);
    dfs3(L, L, deep2);
    vector<int> outros;
    for (int i = 1; i <= n; i++) {
      if (deep2[i] - 1 == dist) {
        outros.push_back(i);
      }
    }
    int R = query(outros).first;
    cout << "! " << L << " " << R << endl;
    string inutil;
    cin >> inutil;
    assert(inutil[0] == 'C');
  }
}
int summod(vector<int> w) {
  int curr = 0;
  for (int i = 0; i < (int)(w).size(); i++) {
    curr = (curr + w[i]) % mod;
    if (curr < 0) curr += mod;
  }
  return curr;
}
int prodmod(vector<int> w) {
  int curr = 1;
  for (int i = 0; i < (int)(w).size(); i++) {
    if (w[i] >= mod) w[i] %= mod;
    curr = (curr * w[i]) % mod;
    if (curr < 0) curr += mod;
  }
  return curr;
}