#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
int n, m, k;
int deg[N], stat[N], val[N], rox[N];
vector<int> G[N];
set<int> intr, kozak;
vector<long long> g;
void zbij(int v) {
  deg[v]--;
  if (stat[v] == 2 && deg[v] <= k - 1) {
    stat[v]--;
    kozak.erase(v);
    intr.insert(v);
  }
  if (stat[v] == 1 && deg[v] <= k - 2) {
    stat[v]--;
    intr.erase(v);
    for (auto &x : (G[v]))
      if (stat[x]) rox[x] ^= val[v], zbij(x);
  }
}
void solve() {
  cin >> n >> m >> k;
  for (int i = (0); i < (n); i++) G[i].clear();
  g.clear();
  intr.clear();
  kozak.clear();
  for (int i = (0); i < (n); i++) val[i] = rox[i] = rand();
  for (int i = (0); i < (m); i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    G[a].push_back(b);
    G[b].push_back(a);
    rox[a] ^= val[b];
    rox[b] ^= val[a];
    g.push_back(1ll * INF * a + b);
    g.push_back(1ll * INF * b + a);
  }
  sort(g.begin(), g.end());
  for (int i = (0); i < (n); i++) {
    deg[i] = ((int)(G[i]).size()) + 1;
    stat[i] = 2;
    kozak.insert(i);
  }
  for (int i = (0); i < (n); i++) zbij(i);
  while (((int)(intr).size()) > 0) {
    int v = *intr.begin();
    vector<int> ziomy;
    for (auto &x : (G[v]))
      if (stat[x]) ziomy.push_back(x);
    bool ok = 1;
    for (auto &x : (ziomy))
      if (stat[x] == 1 && rox[x] != rox[v]) ok = 0;
    for (int i = (0); i < (((int)(ziomy).size())); i++) {
      if (!ok) break;
      for (int j = (i + 1); j < (((int)(ziomy).size())); j++) {
        if (!ok) break;
        long long co = 1ll * INF * ziomy[i] + ziomy[j];
        int ind = lower_bound(g.begin(), g.end(), co) - g.begin();
        if (ind == ((int)(g).size()))
          ok = 0;
        else
          ok &= g[ind] == co;
      }
    }
    if (ok) {
      cout << 2 << '\n';
      for (auto &x : (ziomy)) cout << x + 1 << ' ';
      cout << v + 1 << '\n';
      return;
    }
    zbij(v);
  }
  if (((int)(kozak).size()) > 0) {
    cout << 1 << ' ' << ((int)(kozak).size()) << '\n';
    for (auto &x : (kozak)) cout << x + 1 << ' ';
    cout << '\n';
  } else
    cout << -1 << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  srand(123);
  int tt;
  cin >> tt;
  for (int te = (0); te < (tt); te++) {
    solve();
  }
  return 0;
}
