#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
vector<long long> adjlist[200010];
long long neigh[200010];
long long exists[200010];
void solve() {
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; i++) {
    exists[i] = 1;
    adjlist[i].clear();
    neigh[i] = 0;
  }
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    adjlist[a].push_back(b);
    neigh[a]++;
    adjlist[b].push_back(a);
    neigh[b]++;
  }
  if (k * (k - 1) / 2 > m) {
    cout << "-1\n";
    return;
  }
  queue<long long> q;
  for (long long i = 1; i <= n; i++) {
    sort(adjlist[i].begin(), adjlist[i].end());
    if (neigh[i] < k - 1) q.push(i);
  }
  while (!q.empty()) {
    long long x = q.front();
    q.pop();
    if (exists[x] == 0) continue;
    exists[x] = 0;
    for (auto i : adjlist[x])
      if (exists[i]) {
        neigh[i]--;
        if (neigh[i] < k - 1) q.push(i);
      }
  }
  for (long long i = 1; i <= n; i++) {
    if (neigh[i] < k) q.push(i);
  }
  while (!q.empty()) {
    long long cur = q.front();
    q.pop();
    if (exists[cur] == 0) continue;
    exists[cur] = 0;
    if (neigh[cur] == k - 1) {
      bool canclique = true;
      vector<long long> vv;
      for (auto i : adjlist[cur])
        if (exists[i]) {
          vv.push_back(i);
        }
      for (long long i = 0; i < (long long)vv.size() and canclique; i++) {
        for (long long j = i + 1; j < (long long)vv.size() and canclique; j++) {
          if (!binary_search(adjlist[vv[i]].begin(), adjlist[vv[i]].end(),
                             vv[j]))
            canclique = false;
        }
      }
      if (canclique) {
        cout << "2\n";
        cout << cur << " ";
        for (auto i : vv) {
          cout << i << " ";
        }
        cout << "\n";
        return;
      }
    }
    for (auto i : adjlist[cur])
      if (exists[i]) {
        neigh[i]--;
        if (neigh[i] < k) q.push(i);
      }
  }
  vector<long long> ans;
  for (long long i = 1; i <= n; i++)
    if (exists[i]) {
      ans.push_back(i);
    }
  if (ans.empty()) {
    cout << "-1\n";
    return;
  } else {
    cout << 1 << " " << ans.size() << "\n";
    for (auto i : ans) {
      cout << i << " ";
    }
    cout << "\n";
    return;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long tc;
  cin >> tc;
  while (tc--) solve();
}
