#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "{" << p.first << "," << p.second << "}";
  return os;
}
const int N = 3e5 + 5;
const int oo = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int ask(const vector<int> &a, const vector<int> &b) {
  cout << "? " << a.size() << " " << b.size() << "\n";
  for (int i : a) cout << i << " ";
  cout << "\n";
  for (int i : b) cout << i << " ";
  cout << endl;
  string s;
  cin >> s;
  assert(s != "WASTED");
  if (s == "FIRST") return 1;
  if (s == "SECOND") return -1;
  if (s == "EQUAL") return 0;
}
vector<int> range(int l, int r) {
  vector<int> ret(r - l + 1);
  for (int i = 0; i < r - l + 1; i++) ret[i] = i + l;
  return ret;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T, cs = 0;
  cin >> T;
  while (T--) {
    int n, k;
    cin >> n >> k;
    bool choto = 0;
    for (int i = 1; i <= 30; i++) {
      int x = rng() % n;
      if (x == 0) x++;
      x++;
      choto = choto or ask({1}, {x}) == -1;
      if (choto) break;
    }
    if (choto) {
      cout << "! 1" << endl;
    } else {
      int lo = -1, hi = -1;
      for (int i = 0; i < 30; i++) {
        int l = 1, r = 1 << i;
        int lp = r + 1;
        int rp = lp + r - l;
        if (rp > n or ask(range(l, r), range(lp, rp)) == 1) {
          lo = min(lp, n), hi = min(rp, n);
          break;
        }
      }
      int len = lo - 1;
      while (lo < hi) {
        int mid = (lo + hi) / 2;
        if (ask(range(1, 1 + mid - lo), range(lo, mid)) == 1)
          hi = mid;
        else
          lo = mid + 1;
      }
      cout << "! " << hi << endl;
    }
  }
}
