#include <bits/stdc++.h>

using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define rep(a, b, c) for(int (a)=(b);(a)<=(c);(a)++)
#define per(a, b, c) for(int (a)=(b);(a)>=(c);(a)--)
#define mset(var, val) memset(var,val,sizeof(var))
#define ll long long
#define int ll
#define fi first
#define se second
#define no "NO\n"
#define yes "YES\n"
#define pb push_back
#define endl "\n"
#define pii pair<int,int>
#define pll pair<ll,ll>
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)

void err() { cout << '\n'; }

template<class T, class... Ts>
void err(T arg, Ts... args) {
    cout << arg << ' ';
    err(args...);
}

const int N = 2e5 + 5;
const int M = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int P = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);

int n, m, s, t, mid, sqn, cnt, dep[N];
int tot=0, lnk[N], son[M<<1], nxt[M<<1];
bool f[N];

queue<int>q;

void add(int x, int y) {
    son[++tot] = y, nxt[tot] = lnk[x], lnk[x] = tot;
}

void bfs2(int x) {
    while(!q.empty()) q.pop();
    dep[x] = 1;
    f[x] = 1, cnt = 1;
    q.push(x);
    while(!q.empty()) {
        int u = q.front(), out=0, flg=0; q.pop();
        // if((dep[u]-1) % sqn == 0) cnt++, f[u] = 1;
        for(int i = lnk[u]; i != -1; i = nxt[i]) {
            int v = son[i];
            if(dep[v] || v == x) continue;
            dep[v] = dep[u]+1, out++;
            if((dep[v]-1)%sqn == 0) {
                if(!flg)cnt++, f[v] = 1, flg=1;
                else dep[v]++;
            }
            q.push(v);
        }
        // if(qaq[dep[u]] || (!out && check(dep[u]) && u != x)) cnt++, f[u] = 1;
    }
}

void solve() {
    cin >> n >> m;
    sqn = sqrt(n-1)+1, tot=0;
    for(int i = 1; i <= n; i++)
        lnk[i] = -1, dep[i] = 0, f[i] = 0;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        add(x, y); add(y, x);
    }

    if(n == 1) {
        printf("1\n1\n");
        return;
    }
    // s=1;
    // for(int i = 1; i <= n; i++)
    //     if(in[i] > in[s]) s = i;
    
    cnt=0;
    bfs2(1);

    if(cnt <= sqrt(n-1)+1) {
        printf("%d\n", cnt);
        for(int i = 1; i <= n; i++)
            if(f[i]) printf("%d ", i);
        printf("\n");
    }
    else printf("-1\n");
}

signed main() {
    IOS;
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}