#include <bits/stdc++.h>
#define File(name) freopen(#name".in", "r", stdin); freopen(#name".out", "w", stdout);
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T>
inline T read(){
    T n = 0; int f = 1; char ch = getchar();
    while(!isdigit(ch)){
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(isdigit(ch)){
        n = n * 10 + ch - '0';
        ch = getchar();
    }
    return f * n;
}
template<typename T>
void write(T n){
    if(n < 0) return putchar('-'), write(-n);
    if(n / 10) write(n / 10);
    putchar(n % 10 + '0');
}
void input() {}
template<typename Type, typename... Types>
void input(Type &arg, Types &...args){
    arg = read<Type>();
    input(args...);
}
namespace Main{
    const int N = 1005;
    int t, n, m, k, cnt[N], tot, x, ans;
    bool cho[N], vis[N], leave[N];
    vector<int> g[N];
    vector<pair<int, int>> vec;
    void dfs(int u){
        int deg = 0;
        vis[u] = true, tot++;
        for(int v: g[u]){
            if(cho[v]) continue;
            deg++;
            if(!vis[v]) dfs(v);
        }
        cnt[deg]++;
        vec.emplace_back(u, deg);
        if(deg > 2) x = u;
    }
    void update(int siz){
        if(siz < ans){    
            for(int i = 1; i <= n; i++) leave[i] = cho[i];
            ans = siz;
        }
        else if(siz == ans){
            for(int i = 1; i <= n; i++) if(cho[i]) leave[i] = true;
        }
    }
    void solve(){
        bool ok = true;
        int res = count(cho + 1, cho + n + 1, true);
        if(res > k) return;
        memset(vis, 0, sizeof(vis));
        vector<int> tmp;
        for(int i = 1; i <= n; i++){
            if(cho[i] || vis[i]) continue;
            tot = 0;
            dfs(i);
            if(tot > 1){
                if(cnt[1] + cnt[2] == tot){
                    if(cnt[2] == tot){
                        res += (tot + 1) / 2;
                        for(auto [u, d]: vec) tmp.push_back(u), cho[u] = true;
                    }
                    else{
                        res += tot / 2;
                        if(tot & 1){
                            for(int j = 1; j < tot; j += 2){
                                tmp.push_back(vec[j].first);
                                cho[vec[j].first] = true;
                            }
                        }
                        else{
                            for(auto [u, d]: vec) tmp.push_back(u), cho[u] = true;
                        }
                    }
                }
                else ok = false;
            }
            for(auto [u, d]: vec) cnt[d] = 0;
            vec.clear();
            if(!ok) break;
        }
        if(ok) update(res);
        for(int x: tmp) cho[x] = false;
        tmp.clear();
        if(ok) return;
        cho[x] = true;
        solve();
        cho[x] = false;
        for(int i: g[x]){
            if(!cho[i]) tmp.push_back(i), cho[i] = true;
        }
        solve();
        for(int i: tmp) cho[i] = false;
    }
    void Main(){
        input(t);
        while(t--){
            for(int i = 1; i <= n; i++) g[i].clear();
            input(n, m, k);
            for(int i = 0, u, v; i < m; i++){
                input(u, v);
                g[u].push_back(v), g[v].push_back(u);
            }
            ans = 1e9;
            solve();
            if(ans > k) puts("-1");
            else{
                int c = count(leave + 1, leave + n + 1, true);
                write(ans), putchar(' '), write(c), puts("");
                for(int i = 1; i <= n; i++){
                    if(leave[i]) write(i), putchar(' ');
                }
                puts("");
            }
        }
        return;
    }
} // namespace Main
int main(){
#ifdef Liuxizai
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif // Liuxizai
    Main::Main();
    return 0;
}