#include<bits/stdc++.h>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
#define int ll

const int N = 2e5+10;
const int M = 1e6 + 7;

int n, m, fa[N], mx;
vector<ll> edge[N], ans;
bool vis[N];
int ok=1;
void init(){
    // ans.clear();
    for (int i = 0; i <= n; i++) edge[i].clear(),vis[i]=0;
    ok=1;
    ans.clear();
    mx = sqrt(n);
    if (mx * mx < n)mx++;
}

int dfs(int u){
    int dis=0;
    vis[u]=1;
    for(int v:edge[u]){
        if(vis[v])continue;
        // vis[v]=1;
        dis=max((dfs(v)+1),dis);
    }
    // cout<<"u->"<<u<<" dis->"<<dis<<endl;
    if(dis==mx){
        ans.push_back(u);
        if(u==1){
            ok=0;
        }
        return -1;
    }
    return dis;
}


inline void solve(){
    cin >> n >> m;
    init();
    for (int i = 1, u, v; i <= m; i++){
        cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    // cout<<"mx->"<<mx<<endl;
    // ans.push_back(1);
    if(ok){
        ans.push_back(1);
    }
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<"\n";for(int i:ans)cout<<i<<" ";cout<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}