#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
int N, M, K, deg[maxn];
bool used[maxn];
unordered_set<int> G[maxn];
bool check(int u) {
  for (int v : G[u]) {
    for (int w : G[u]) {
      if (v == w) continue;
      if (!G[v].count(w)) return 0;
    }
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    cin >> N >> M >> K;
    for (int i = 1; i <= N; ++i) {
      G[i].clear();
      deg[i] = used[i] = 0;
    }
    for (int u, v, i = 1; i <= M; ++i) {
      cin >> u >> v;
      G[u].insert(v);
      G[v].insert(u);
      deg[u]++;
      deg[v]++;
    }
    if (1ll * K * (K - 1) > 2ll * M) {
      cout << -1 << '\n';
      continue;
    }
    if (K == 1) {
      cout << 2 << '\n' << 1 << '\n';
      continue;
    }
    queue<int> Q;
    for (int i = 1; i <= N; ++i)
      if (deg[i] < K) {
        Q.push(i);
        used[i] = 1;
      }
    bool con = 0;
    while (!Q.empty()) {
      int u = Q.front();
      Q.pop();
      if (deg[u] == K - 1) {
        if (check(u)) {
          cout << 2 << '\n';
          for (int v : G[u]) cout << v << ' ';
          cout << u << '\n';
          con = 1;
          break;
        }
      }
      while (!G[u].empty()) {
        int v = *G[u].begin();
        G[v].erase(u);
        G[u].erase(v);
        deg[u]--;
        deg[v]--;
        if (deg[v] < K && !used[v]) {
          Q.push(v);
          used[v] = 1;
        }
      }
    }
    if (con) continue;
    vector<int> Ans;
    for (int i = 1; i <= N; ++i)
      if (!used[i]) Ans.push_back(i);
    if (Ans.empty()) {
      cout << -1 << '\n';
    } else {
      cout << 1 << ' ' << (int)Ans.size() << '\n';
      for (int u : Ans) cout << u << ' ';
      cout << '\n';
    }
  }
  return 0;
}
