#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using db = double;
using ull = unsigned long long;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
 
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;
 
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
 
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rrep(i,a,b) for(int i = (b) - 1; i >= (a); i--)
 
const db PI = acos(-1);
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
 
tcT> bool ckmin(T& a, const T& b) { return b < a ? a=b, 1 : 0; }
tcT> bool ckmax(T& a, const T& b) { return a < b ? a=b, 1 : 0; }
 
tcT> void _dbg(const char *sdbg, T h){ cerr<<sdbg<<'='<<h<<endl; }
tcT, class... TA> void _dbg(const char *sdbg, T h, TA... a) {
	while(*sdbg!=',') cerr<<*sdbg++;
	cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}
 
tcT> ostream &operator<<(ostream& os, vector<T> V) {
	os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
tcT, class V> ostream &operator<<(ostream &os, pair<T,V> P) {
	return os << "(" << P.f << "," << P.s << ")";
}
 
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

struct kVC {
	int n;
	vector<vi> g;
	vi deg;
	int k;
	vector<bool> in_cover;
	vector<vector<bool>> in_cover_final;
	int cover_size;
	bool any_cover;

	kVC(int _n, int _k) : n(_n), g(_n), deg(_n, 0), k(_k), in_cover(_n, false), in_cover_final(_k+1), cover_size(0), any_cover(false) {
		rep(i,0,k+1) {
			in_cover_final[i].resize(n, false);
		}
	}

	void add_to_cover(int u) {
		in_cover[u] = true;;
		cover_size++;

		for (int v : g[u]) {
			if (in_cover[v]) continue;
			deg[v]--;
			deg[u]--;
		}
	}

	void delete_from_cover(int u) {
		in_cover[u] = false;
		cover_size--;

		for (int v : g[u]) {
			if (in_cover[v]) continue;
			deg[v]++;
			deg[u]++;
		}
	}

	void solve_primitive() {
		int vis[n];
		bool vis2[n];
		fill(vis, vis+n, 0);
		fill(vis2, vis2+n, false);

		int dsusize = 0;

		function<void(int, int)> mark_all = [&](int u, int col) {
			vis[u] = col + 1;
			dsusize++;

			for (int v : g[u]) {
				if (vis[v] || in_cover[v]) continue;
				mark_all(v, col^1);
			}
		};

		function<void(int)> remark = [&](int u) {
			vis2[u] = true;
			vis[u] = 2;

			for (int v : g[u]) {
				if (vis2[v] || in_cover[v]) continue;
				remark(v);
			}
		};

		int res = 0;

		// sciezki
		rep(i,0,n) {
			if (vis[i] || deg[i] != 1) continue;

			dsusize = 0;
			mark_all(i, 0);

			res += dsusize / 2;

			if (cover_size + res > k) return;

			if (dsusize % 2 == 0) {
				remark(i);
			}
		}

		// cykle
		rep(i,0,n) {
			if (vis[i] || deg[i] == 0) continue;

			dsusize = 0;
			mark_all(i,1);

			res += (dsusize + 1) / 2;

			if (cover_size + res > k) return;

			remark(i);
		}

		rep(i,0,n) {
			if (vis[i] == 2 || in_cover[i]) {
				in_cover_final[cover_size + res][i] = true;
			}
		}

		any_cover = true;
		ckmin(k, cover_size + res);
	}

	void getvc() {
		if (cover_size > k) return;
		int max_deg_vertex = 0;

		rep(i,1,n) {
			if (deg[i] > deg[max_deg_vertex]) {
				max_deg_vertex = i;
			}
		}

		if (k == 0 && deg[max_deg_vertex] > 0) {
			return;
		}

		// only paths and cycles
		if (deg[max_deg_vertex] < 3) {
			solve_primitive();
			return;
		}

		add_to_cover(max_deg_vertex);
		getvc();
		delete_from_cover(max_deg_vertex);


		vi added_to_cover;
		for (int v : g[max_deg_vertex]) {
			if (!in_cover[v]) {
				add_to_cover(v);
				added_to_cover.pb(v);
				if (cover_size > k) break;
			}
		}

		if (cover_size <= k) {
			getvc();
		}

		for (int v : added_to_cover) {
			delete_from_cover(v);
		}
	}
};

void solve() {
	int n, m, k;
	cin >> n >> m >> k;

	vi input_g[n];
	set<pair<int, int>> edges;

	rep(i,0,m) {
		int a, b;
		cin >> a >> b;
		a--; b--;

		if (a > b) swap(a, b);

		if (edges.count(mp(a, b))) continue;
		edges.insert(mp(a, b));

		input_g[a].pb(b);
		input_g[b].pb(a);
	}

	set<int> must_be_in_cover;
	set<int> interesting;

	rep(u,0,n) {
		if (sz(input_g[u]) > k) {
			must_be_in_cover.insert(u);
			continue;
		}

		for (int v : input_g[u]) {
			if (sz(input_g[v]) <= k) {
				interesting.insert(u);
				break;
			}
		}
	}

	if (sz(must_be_in_cover) > k) {
		cout << "-1\n";
		return;
	}

	int sc[n], scr[n];
	int sct = 0;

	for (int i : interesting) {
		sc[i] = sct++;
		scr[sc[i]] = i;
	}

	if (sz(interesting) == 0) {
		cout << sz(must_be_in_cover) << " " << sz(must_be_in_cover) << "\n";
		for (int v : must_be_in_cover) {
			cout << v+1 << " ";
		}
		cout << "\n";
		return;
	}

	kVC kvc(sz(interesting), k - sz(must_be_in_cover));

	for (int u : interesting) {
		for (int v : input_g[u]) {
			if (must_be_in_cover.count(v)) continue;
			kvc.g[sc[u]].pb(sc[v]);
			kvc.deg[sc[u]]++;
		}
	}

	kvc.getvc();

	if (!kvc.any_cover) {
		cout << "-1\n";
		return;
	}

	vi res;
	rep(i,0,kvc.n) {
		if (kvc.in_cover_final[kvc.k][i]) {
			res.pb(scr[i]);
		}
	}

	for (int i : must_be_in_cover) {
		res.pb(i);
	}

	sort(all(res));

	cout << kvc.k + sz(must_be_in_cover) << " " << sz(res) << "\n";
	for (int v : res) cout << v+1 << " ";
	cout << "\n";
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);

	int t;
	cin >> t;
	while (t--) solve(); 

	return 0;
}