#include <bits/stdc++.h>
std::vector<int> vec[100010];
int r[100010];
int cnt[100010];
bool del[100010], inQueue[100010];
bool judge(int x) {
  std::vector<int> t;
  for (int i : vec[x])
    if (!del[i]) t.push_back(i);
  for (int i : t)
    if (i != x) {
      for (int j : t) {
        if (i == j) break;
        if (!std::binary_search(vec[i].begin(), vec[i].end(), j)) return false;
      }
    }
  return true;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m, k, u, v;
    scanf("%d %d %d", &n, &m, &k);
    for (int i = 0; i < n; ++i) {
      vec[i].clear();
      inQueue[i] = del[i] = false;
    }
    for (int i = 0; i < m; ++i) {
      scanf("%d %d", &u, &v);
      --u;
      --v;
      vec[u].push_back(v);
      vec[v].push_back(u);
    }
    std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>,
                        std::greater<std::pair<int, int>>>
        que;
    for (int i = 0; i < n; ++i) {
      vec[i].push_back(i);
      std::sort(vec[i].begin(), vec[i].end());
      cnt[i] = vec[i].size();
      if (cnt[i] <= k) que.push(std::pair<int, int>(cnt[i], i));
    }
    bool flag = false;
    while (!que.empty()) {
      std::pair<int, int> x = que.top();
      que.pop();
      if (del[x.second]) continue;
      if (cnt[x.second] == k) {
        if ((flag = judge(x.second))) {
          printf("2\n");
          for (int y : vec[x.second])
            if (!del[y]) {
              printf("%d ", y + 1);
            }
          printf("\n");
          break;
        }
      }
      del[x.second] = true;
      for (auto it = vec[x.second].begin(); it != vec[x.second].end(); ++it)
        if (*it != x.second) {
          if (--cnt[*it] <= k && !del[*it]) {
            que.push(std::pair<int, int>(cnt[*it], *it));
          }
        }
    }
    if (flag) continue;
    int cnt2 = 0;
    for (int i = 0; i < n; ++i)
      if (!del[i]) ++cnt2;
    if (cnt2 == 0) {
      printf("-1\n");
      continue;
    }
    printf("1 %d\n", cnt2);
    for (int i = 0; i < n; ++i)
      if (!del[i]) {
        printf("%d ", i + 1);
      }
    printf("\n");
  }
  return 0;
}
