#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acos(-1.0);
void chmin(long long &a, long long b) { a = min(a, b); }
void chmax(long long &a, long long b) { a = max(a, b); }
long long mod_pow(long long a, long long n, long long m = mod) {
  a %= m;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
string query(vector<int> &a, vector<int> &b) {
  cout << "? " << a.size() << " " << b.size() << endl;
  for (int i = 0; i < a.size(); i++) {
    if (i > 0) cout << " ";
    cout << a[i] + 1;
  }
  cout << endl;
  for (int i = 0; i < b.size(); i++) {
    if (i > 0) cout << " ";
    cout << b[i] + 1;
  }
  cout << endl;
  string res;
  cin >> res;
  return res;
}
void solve() {
  int n, k;
  cin >> n >> k;
  int le = 0, ri = n;
  while (ri - le > 1) {
    int m = (le + ri) / 2;
    int len = ri - le;
    vector<int> a, b;
    for (int i = 0; i < len / 2; i++) a.push_back(le + i);
    for (int i = 0; i < len / 2; i++) b.push_back(le + (len + 1) / 2 + i);
    string q = query(a, b);
    if (q == "SECOND") {
      le += len / 2;
    } else {
      ri = le + (len + 1) / 2;
    }
  }
  vector<bool> non(n, false);
  non[le] = true;
  vector<int> ct;
  for (int i = 0; i < 11; i++) {
    int num = (1 << i);
    if (num * 2 > n) {
      for (int j = 0; j < n; j++)
        if (!non[j]) {
          ct.push_back(j);
        }
      break;
    }
    vector<int> a;
    for (int j = 0; j < n; j++) {
      if (non[j]) continue;
      if (a.size() < num) a.push_back(j);
    }
    vector<int> b;
    for (int j = 0; j < n; j++) {
      if (non[j] && b.size() < num) b.push_back(j);
    }
    string q = query(a, b);
    if (q == "EQUAL") {
      for (int id : a) {
        non[id] = true;
      }
    } else {
      ct = a;
      break;
    }
  }
  while (ct.size() > 1) {
    vector<int> a;
    int len = ct.size() / 2;
    for (int i = 0; i < len; i++) a.push_back(ct[i]);
    vector<int> b;
    for (int i = 0; i < n; i++) {
      if (non[i] && b.size() < len) b.push_back(i);
    }
    string q = query(a, b);
    if (q == "EQUAL") {
      ct.erase(ct.begin(), ct.begin() + len);
    } else {
      ct.resize(len);
    }
  }
  cout << "! " << ct[0] + 1 << endl;
}
signed main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) solve();
  char nyaa;
  cin >> nyaa;
  return 0;
}
