#include <bits/stdc++.h>
using namespace std;

const int Maxn = 200500;

struct Enode{
    int u, v;
} E[1000500];

vector <int> son[Maxn], ans;
int dep[Maxn], maxd[Maxn], p[Maxn];
int n, m, LMT;

void cmax(int &x, int y){ if (x < y) x = y; }

void dfs(int u, int fa){
    for (auto v : son[u]) if (v != fa){
        dep[v] = dep[u] + 1;
        dfs(v, u);
    }
}

void solve(int u, int fa){
    maxd[u] = dep[u];
    for (auto v : son[u]) if (v != fa){
        solve(v, u);
        if (maxd[v] - dep[u] > LMT){
            ans.push_back(v);
        } else {
            cmax(maxd[u], maxd[v]);
        }
    }
}

void init(int n){
    for (int i = 1; i <= n; i++)
        son[i].clear();
    dep[1] = 0;
    for (int i = 1; i <= n; i++)
        p[i] = i;
    LMT = sqrt(n);
    if (LMT * LMT < n)
        LMT++;
}

int getfa(int u){
    if (u == p[u])
        return u;
    return p[u] = getfa(p[u]);
}

int main(){
    int T; cin >> T;
    while (T--){
        cin >> n >> m, init(n);
        for (int i = 1; i <= m; i++)
            cin >> E[i].u >> E[i].v;
        for (int i = 1; i <= m; i++){
            int u = E[i].u, v = E[i].v;
            int fu = getfa(u), fv = getfa(v);
            if (fu == fv)
                continue;
            p[fu] = fv;
            son[u].push_back(v);
            son[v].push_back(u);
        }
        dfs(1, 0), solve(1, 0);
        if (ans.size() > LMT){
            puts("-1");
        } else {   
            cout << ans.size() << '\n';
            for (int i = 0, si = ans.size(); i < si; i++)
                cout << ans[i] << (i == si - 1 ? '\n' : ' ');
        }
    }
    return 0;
}
/*
2
4 3
1 2 
2 3 
3 4 
6 7 
1 2 
2 3 
3 1 
1 4 
4 5 
5 6 
6 4
*/