#include <bits/stdc++.h>
using namespace std;
class Response {
 public:
  static const int NOTHING = -1;
  static const int SUBSET = 1;
  static const int CLIQUE = 2;

 public:
  int ANSWER_TYPE = NOTHING;
  vector<int> vertices;
  Response() : ANSWER_TYPE(NOTHING) {}
  Response(int typ, vector<int> v) : ANSWER_TYPE(typ), vertices(v) {}
};
class Solver {
 private:
  int n, m, k;
  vector<vector<int>> edge;
  vector<unordered_set<int>> neighbor;
  vector<bool> isErased;
  priority_queue<pair<int, int>> wait;

 private:
  inline bool checkEligibility(long long k, long long m) {
    return k * (k - 1) <= 2 * m;
  }
  void deleteNode(int u) {
    for (int v : neighbor[u]) {
      neighbor[v].erase(u);
      wait.push(make_pair(-neighbor[v].size(), v));
    }
    isErased[u] = true;
  }
  bool checkClique(vector<int> &a) {
    for (int i = 0; i < k; i++) {
      const int u = a[i];
      for (int j = i + 1; j < k; j++) {
        const int v = a[j];
        if (neighbor[u].find(v) == neighbor[u].end()) return false;
      }
    }
    return true;
  }

 public:
  Solver(int n, int m, int k, const vector<pair<int, int>> &edgeList) {
    this->n = n;
    this->m = m;
    this->k = k;
    edge = vector<vector<int>>(n + 1);
    neighbor = vector<unordered_set<int>>(n + 1);
    for (pair<int, int> p : edgeList) {
      edge[p.first].push_back(p.second);
      edge[p.second].push_back(p.first);
      neighbor[p.first].insert(p.second);
      neighbor[p.second].insert(p.first);
    }
  }
  Response findSomething() {
    if (!checkEligibility(k, m)) return Response();
    isErased = vector<bool>(n + 1, false);
    for (int i = 1; i <= n; i++) wait.push(make_pair(-neighbor[i].size(), i));
    while (!wait.empty()) {
      int v = wait.top().second;
      wait.pop();
      if (isErased[v]) continue;
      int deg = neighbor[v].size();
      if (deg >= k) {
        vector<int> alive;
        for (int i = 1; i <= n; i++)
          if (!isErased[i]) alive.push_back(i);
        return Response(Response::SUBSET, alive);
      } else {
        if (deg == k - 1) {
          vector<int> cliqueCandidate;
          cliqueCandidate.push_back(v);
          for (int u : neighbor[v]) cliqueCandidate.push_back(u);
          if (checkClique(cliqueCandidate))
            return Response(Response::CLIQUE, cliqueCandidate);
        }
        deleteNode(v);
      }
    }
    return Response();
  }
};
int main() {
  int tc;
  scanf("%d", &tc);
  while (tc--) {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    vector<pair<int, int>> edgeList(m);
    for (int i = 0; i < m; i++)
      scanf("%d%d", &edgeList[i].first, &edgeList[i].second);
    Solver bot(n, m, k, edgeList);
    Response ans = bot.findSomething();
    if (ans.ANSWER_TYPE == Response::NOTHING) {
      printf("-1\n");
    } else {
      printf("%d", ans.ANSWER_TYPE);
      if (ans.ANSWER_TYPE == Response::SUBSET)
        printf(" %d", ans.vertices.size());
      printf("\n");
      for (int v : ans.vertices) printf("%d ", v);
      printf("\n");
    }
  }
  return 0;
}
