#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcount(s)
#define lb(s) (s&-s)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0' && c<='9')x=x*10 + c-'0',c=getchar();
	return x*f;
}
const int N=1e3+3;
const int mod=998244353;
inline void Ad(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
int n,m,k;
bitset<N>bs,ans;int res;
pii p[3*N];
int d[N];
bool vis[N];
int inq[N];
vector<int>G[N],vec;
inline void dfs2(int u){
	vis[u]=1;vec.pb(u);
	for(auto v:G[u])if(!vis[v])dfs2(v);
}
inline void dfs(int k){
	rep(i,1,n)d[i]=0;
	rep(i,1,m)if(!bs[p[i].fi] && !bs[p[i].se])++d[p[i].fi],++d[p[i].se];
	int bst=1;
	rep(i,2,n)if(d[bst]<d[i])bst=i;
	if(d[bst]<=2){
		auto tmp=bst;
		rep(i,1,n)vis[i]=0,G[i].clear();
		rep(i,1,m)if(!bs[p[i].fi] && !bs[p[i].se]){
			int u=p[i].fi,v=p[i].se;
			G[u].pb(v),G[v].pb(u);
		}
		rep(i,1,n)if(!vis[i] && !bs[i] && d[i]==1){
			vec.clear(); dfs2(i);
			int m=vec.size();k += m>>1;
			for(int i=m&1;i<m;i+=1+(m&1))bs.set(vec[i]);
		}
		rep(i,1,n)if(!vis[i] && !bs[i] && d[i]==2){
			vec.clear(); dfs2(i);
			int m=vec.size();k += (m+1)>>1;
			rep(i,0,m-1)bs.set(vec[i]);
		}
		if(k<res) res=k,ans.reset();
		if(res==k)ans|=bs;
		return ;
	}
	bs.set(bst);dfs(k+1);bs.reset(bst);
	rep(i,1,m)if(!bs[p[i].fi] && !bs[p[i].se] && (p[i].fi==bst || p[i].se==bst)){
		if(p[i].se==bst)swap(p[i].fi,p[i].se);
		++k;bs.set(p[i].se);
	}
	dfs(k);
	rep(i,1,m)if(!bs[p[i].fi] && !bs[p[i].se] && p[i].fi==bst) bs.reset(p[i].se); 
}
inline void solve(){
	n=read(),m=read(),k=read();
	bs.reset(),ans.reset();res=n;
	rep(i,1,m){
		p[i].fi=read(),p[i].se=read();
	}
	dfs(0);
	if(res>k){ puts("-1"); return ; }
	printf("%d %d\n",res,ans.count());
	for(int i=ans._Find_first();i<=n;i=ans._Find_next(i))printf("%d ",i);
	puts("");
}
int main(){
	//freopen("data.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int T=read();while(T--)solve();
}