1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
namespace debug { template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> char spk(...); template <class c> auto spk(c* a) -> decltype(cerr << *a, 0); struct stream { ~stream() { cerr << endl; } template <class c> typename enable_if <sizeof spk<c>(0) != 1, stream&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if <sizeof spk<c>(0) == 1, stream&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class a, class b> stream& operator<<(pair <a,b> p) { return *this << "(" << p.first << ", " << p.second << ")"; } template <class c> stream& operator<<(rge<c> d) { *this << "["; for (auto it=d.b; it!=d.e; it++) *this << ", " + 2 * (it == d.b) << *it; return *this << "]"; } stream& _dbg(const string& s, int i, int b) { return *this; } template <class c, class ... cs> stream& _dbg(const string& s, int i, int b, c arg, cs ... args) { if (i == (int)(s.size())) return (*this << ": " << arg); b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{') - (s[i] == ')') - (s[i] == ']') - (s[i] == '}'); return (s[i] == ',' && b == 0) ? (*this << ": " << arg << "     ")._dbg(s, i + 1, b, args...) : (s[i] == ' ' ? *this : *this << s[i])._dbg(s, i + 1, b, arg, args...); } };}
#define dout debug::stream()
#define dbg(...) ((dout << ">> ")._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__))
#define f first
#define s second
#define sc scanf
#define pr printf
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define ss(x) ((int)((x).size()))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(b);i>=(a);i--)
#define upgrade cin.tie(0)->sync_with_stdio(0);
#define lowb(v,x) (lower_bound(all(v),(x))-v.begin())
#define uppb(v,x) (upper_bound(all(v),(x))-v.begin())
#define erase_duplicates(x) {sort(all(x));x.resize(unique(all(x))-x.begin());}
template <class p, class q> pair<p,q> operator-(pair<p,q> a, pair<p,q> b) { return mp(a.f - b.f, a.s - b.s); }
template <class p, class q> pair<p,q> operator+(pair<p,q> a, pair<p,q> b) { return mp(a.f + b.f, a.s + b.s); }
template <class p, class q> void umin(p &a, const q &b) { if (a > b) a = b; }
template <class p, class q> void umax(p &a, const q &b) { if (a < b) a = b; }
using lf=long double;
using ll=long long;
using cll=const ll;
using cint=const int;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //

const int inf = 1e9 + 5;
const int M = 1024;
const int N = 1005;
int n, m, k;
int out[N];
int deg[N];
bool del[N];
vector <int> e[N];
vector <int> dels;
int tree[M + M];

static inline void update(int u, int v)
{
	tree[u += M] = v;
	tree[u >> 1] = deg[tree[u >> 0]] >= deg[tree[(u >> 0) ^ 1]] ? tree[u >> 0] : tree[(u >> 0) ^ 1];
	tree[u >> 2] = deg[tree[u >> 1]] >= deg[tree[(u >> 1) ^ 1]] ? tree[u >> 1] : tree[(u >> 1) ^ 1];
	tree[u >> 3] = deg[tree[u >> 2]] >= deg[tree[(u >> 2) ^ 1]] ? tree[u >> 2] : tree[(u >> 2) ^ 1];
	tree[u >> 4] = deg[tree[u >> 3]] >= deg[tree[(u >> 3) ^ 1]] ? tree[u >> 3] : tree[(u >> 3) ^ 1];
	tree[u >> 5] = deg[tree[u >> 4]] >= deg[tree[(u >> 4) ^ 1]] ? tree[u >> 4] : tree[(u >> 4) ^ 1];
	tree[u >> 6] = deg[tree[u >> 5]] >= deg[tree[(u >> 5) ^ 1]] ? tree[u >> 5] : tree[(u >> 5) ^ 1];
	tree[u >> 7] = deg[tree[u >> 6]] >= deg[tree[(u >> 6) ^ 1]] ? tree[u >> 6] : tree[(u >> 6) ^ 1];
	tree[u >> 8] = deg[tree[u >> 7]] >= deg[tree[(u >> 7) ^ 1]] ? tree[u >> 7] : tree[(u >> 7) ^ 1];
	tree[u >> 9] = deg[tree[u >> 8]] >= deg[tree[(u >> 8) ^ 1]] ? tree[u >> 8] : tree[(u >> 8) ^ 1];
	tree[u >>10] = deg[tree[u >> 9]] >= deg[tree[(u >> 9) ^ 1]] ? tree[u >> 9] : tree[(u >> 9) ^ 1];
}

static inline void delet(int u)
{
	for (cint& v : e[u]){
		if (del[v] == true) continue;
		deg[v] -= 1;
		update(v, v);
	}
	update(u, 0);
	del[u] = true;
	dels.pb(u);
}

static inline void rollback()
{
	int u = dels.back();
	dels.pop_back();
	assert(del[u] == true);
	for (cint& v : e[u]){
		if (del[v] == true) continue;
		deg[v] += 1;
		update(v, v);
	}
	update(u, u);
	del[u] = false;
}

void req()
{
	cint dep = ss(dels);

	if (dep > k) return;

	int u = tree[1];
	
	if (u == 0){
		for (cint& v : dels){
			umin(out[v], dep);
		}
		return;
	}

	delet(u);

	req();
	
	rollback();

	for (cint& v : e[u]){
		if (del[v] == true) continue;
		delet(v);
	}

	req();
	
	while (dels.size() > dep){
		rollback();
	}
}

void solve()
{
	scanf("%d%d%d", &n, &m, &k);

	rep(i, 1, n){
		e[i].clear();
		deg[i] = 0;
		out[i] = inf;
	}

	while (m--){
		int a, b;
		scanf("%d%d", &a, &b);
		e[a].pb(b);
		e[b].pb(a);
		deg[a] += 1;
		deg[b] += 1;
	}

	rep(i, 0, M + M - 1) tree[i] = 0;

	rep(u, 1, n){
		tree[u + M] = u;
	}

	per(u, 1, M - 1){
		cint& l = tree[u + u + 0];
		cint& r = tree[u + u + 1];
		tree[u] = deg[l] >= deg[r] ? l : r;
	}

	req();

	int ans = inf;
	
	rep(i, 1, n) umin(ans, out[i]);

	if (ans == inf){
		printf("-1\n");
		return;
	}
	
	vector <int> vec;

	rep(i, 1, n){
		if (out[i] == ans){
			vec.pb(i);
		}
	}

	printf("%d %d\n", ans, ss(vec));

	sort(all(vec));

	for (int a : vec){
		printf("%d ", a);
	}

	printf("\n");
}

int main()
{
	int q;
	scanf("%d", &q);
	while (q--){
		solve();
	}
	return 0;
}