#include<bits/stdc++.h>

using namespace std;
int T;
int n,m,k,ans;
int pd[1005];
int G[1005][1005],d[1005];
bool chk[1005],vis[1005],hav[1005];
vector<int>son[1005];
vector<int>sav;
void dfs2(int u){
    vis[u]=true;sav.push_back(u);
    for(auto v:son[u])
        if(!vis[v])dfs2(v);
}
void dfs(int now){
    if(now>ans||now>k)return;
    int x=0;
    for(int i=1;i<=n;i++){
        if(chk[i])continue;
        if(d[i]>d[x])x=i;
    }
    if(d[x]<=2){
        for(int i=1;i<=n;i++)vis[i]=false;
        vector<int>p;
        for(int i=1;i<=n;i++)
            if(!vis[i]&&!chk[i]&&d[i]<=1){
                sav.clear();
                dfs2(i);
                now+=sav.size()/2;
                if(sav.size()%2==1)
                    for(int j=0;j<sav.size();j++){
                        if(j%2==1)p.push_back(sav[j]);
                    }
                else for(int j=0;j<sav.size();j++)p.push_back(sav[j]);
                if(now>ans||now>k)return;
            }
        for(int i=1;i<=n;i++)
            if(!vis[i]&&!chk[i]&&d[i]<=2){
                sav.clear();
                dfs2(i);
                now+=(sav.size()+1)/2;
                for(int j=0;j<sav.size();j++)p.push_back(sav[j]);
                if(now>ans||now>k)return;
            }
        if(now<=ans){
            if(now<ans)
                for(int i=1;i<=n;i++)pd[i]=false;
            ans=now;
            for(int i=1;i<=n;i++)
                if(hav[i])pd[i]=true;
            for(auto u:p)pd[u]=true;
        }
        return ;
    }
    else {
        vector<int>th;
        for(auto v:son[x])
            if(!chk[v])th.push_back(v);
        for(auto v:son[x])d[v]--;
        chk[x]=true;hav[x]=true;
        dfs(now+1);
        chk[x]=false;hav[x]=false;
        for(auto v:son[x])d[v]++;
        for(auto v:th){
            chk[v]=true;hav[v]=true;
            for(auto y:son[v])d[y]--;
        }
        chk[x]=true;
        dfs(now+d[x]);
        chk[x]=false;
        for(auto v:th){
            chk[v]=false;hav[v]=false;
            for(auto y:son[v])d[y]++;
        }
    }
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;i++){
            pd[i]=false;son[i].clear();
            for(int j=1;j<=n;j++)
                G[i][j]=0;
        }
        for(int i=1;i<=m;i++){
            int u,v;
            scanf("%d%d",&u,&v);
            G[u][v]=G[v][u]=1;
        }
        for(int i=1;i<=n;i++){
            d[i]=0;
            for(int j=1;j<=n;j++)
                if(G[i][j]){
                    d[i]++;
                    son[i].push_back(j);
                }
        }
        ans=k+1;
        dfs(0);
        if(ans==k+1)puts("-1");
        else {
            vector<int>lans;
            for(int i=1;i<=n;i++)
                if(pd[i])lans.push_back(i);
            printf("%d %d\n",ans,(int)lans.size());
            for(int i=1;i<=n;i++)
                if(pd[i])printf("%d ",i);
            putchar('\n');
        }
    }
    return 0;
}