#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
vector<int> G[MAXN];
int deg[MAXN];
int n, m, k;
queue<int> toRem;
queue<int> clique;
bool ans[MAXN];
int remaining;
bool exists(int u, int v) {
  auto it = lower_bound(G[u].begin(), G[u].end(), v);
  return it != G[u].end() && *it == v;
}
bool check(int v) {
  for (int x : G[v])
    if (ans[x])
      for (int y : G[v])
        if (ans[y] && x > y)
          if (!exists(x, y)) return false;
  return true;
}
void remove(int v) {
  if (!ans[v]) return;
  ans[v] = false;
  remaining--;
  for (int u : G[v]) {
    if (!ans[u]) continue;
    deg[u]--;
    if (deg[u] == k - 2) toRem.push(u);
    if (deg[u] == k - 1) clique.push(u);
  }
}
void solve() {
  for (int i = 0; i < (int)n; i++) sort(G[i].begin(), G[i].end());
  for (int i = 0; i < (int)n; i++) deg[i] = G[i].size();
  for (int i = 0; i < (int)n; i++) {
    if (deg[i] < k - 1) toRem.push(i);
    if (deg[i] == k - 1) clique.push(i);
  }
  for (int i = 0; i < (int)n; i++) ans[i] = true;
  remaining = n;
  while (!toRem.empty() || !clique.empty()) {
    while (!toRem.empty()) {
      remove(toRem.front());
      toRem.pop();
    }
    while (!clique.empty() && !ans[clique.front()]) {
      clique.pop();
    }
    if (!clique.empty()) {
      int v = clique.front();
      clique.pop();
      assert(deg[v] == k - 1);
      if (check(v)) {
        printf("2\n");
        printf("%d", v + 1);
        for (int u : G[v])
          if (ans[u]) printf(" %d", u + 1);
        printf("\n");
        return;
      } else {
        remove(v);
      }
    }
  }
  if (remaining == 0)
    printf("-1\n");
  else {
    printf("1 %d\n", remaining);
    for (int i = 0; i < (int)n; i++)
      if (ans[i]) printf("%d ", i + 1);
    printf("\n");
  }
}
void clearAll() {
  for (int i = 0; i < (int)n; i++) G[i].clear();
  while (!clique.empty()) clique.pop();
  while (!toRem.empty()) toRem.pop();
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n), scanf("%d", &m), scanf("%d", &k);
    for (int i = 0; i < (int)m; i++) {
      int u, v;
      scanf("%d", &u), scanf("%d", &v);
      u--, v--;
      G[u].push_back(v);
      G[v].push_back(u);
    }
    solve();
    clearAll();
  }
  return 0;
}
