#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#define x first
#define y second
using namespace std;
const int N = 2e5 + 10;
int h[N], e[N << 1], ne[N << 1], idx;
bool vis[N];
int ans[N];
pair<int, int> pa[N];
int q[N], tt, hh;

void add(int a, int b) {
    e[++idx] = b, ne[idx] = h[a], h[a] = idx;
}

void bfs(int dis, int x) {
    tt = hh = 0;
    q[0] = x;
    int dep = -1;
    int last_tt = 0;
    while (hh <= tt) {
        int t = q[hh++];
        if (hh == N) hh = 0;
        vis[t] = true;
        
        for (int i = h[t]; i; i = ne[i]) {
            int j = e[i];
            if (tt == N) tt = 0;
            q[++tt] = j;
        }
        if (hh - 1 == last_tt) {
            dep++;
            last_tt = tt;
        }
        if (dep == dis) {
            break;
        }
    }
}

int dfs(int u, int fa, int dis) {
    if (!dis) return u;
    for (int i = h[u]; i; i = ne[i]) {
        int j = e[i];
        if (j == fa) continue;
        return dfs(u, j, dis - 1);
    }
    return u;
}

void solve() {
    
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        pa[i].x = 0;
        pa[i].y = i;
    }
    for (int i = 0; i < m; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        add(u, v), add(v, u);
        pa[u].x++, pa[v].x++;
    }

    sort(pa + 1, pa + n + 1);
    int num = 0;
    int sqrtn = ceil(sqrt(n));

    for (int i = 1; i <= n; i++) {
        if (num == sqrtn) break;
        if (vis[pa[i].y]) continue;
        int u = dfs(pa[i].y, -1, sqrtn);
        ans[num++] = u;
        bfs(sqrtn, u);
    }

   
    printf("%d\n", num);
    for (int i = 0; i < num; i++) {
        printf("%d ", ans[i]);
    }
    puts("");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
        if (T) memset(h, 0, sizeof h), memset(vis, false, sizeof vis);
        idx = 0;
    }
    return 0;
}