// qwq
#include <bits/stdc++.h>
using namespace std;
constexpr int N=1e6+1;
int T,a[N],b[N],fa[N],n,m,pr[N],Pr[N];
vector<pair<int,int>> e[N];
int gf(int x){return fa[x]==x?x:fa[x]=gf(fa[x]);}
int main(){
    cin>>T;
    while(T--){
        cin>>n>>m;
        for(int i=1;i<=n;i++)
            e[i].clear(),fa[i]=i,pr[i]=pr[i]=0;
        for(int i=1;i<=m;i++)
            cin>>a[i]>>b[i];
        bool ok=false;
        for(int i=1;i<=m;i++){
            if(gf(a[i])==gf(b[i])){
                queue<int>q;q.push(a[i]);pr[a[i]]=-1;
                while(!q.empty()){
                    int u=q.front();q.pop();
                    for(auto v:e[u])if(!pr[v.first])
                        pr[v.first]=u,q.push(v.first),Pr[v.first]=v.second;
                }
                vector<int> ans={i}; int x=b[i];
                while(x!=a[i])ans.push_back(Pr[x]),x=pr[x];
                sort(ans.begin(),ans.end());cout<<ans[0];
                for(int i=1;i<ans.size();i++)cout<<' '<<ans[i];puts("");
                ok=1;
                break;
            }
            else
                e[a[i]].push_back({b[i],i}),
                e[b[i]].push_back({a[i],i}),
                fa[gf(a[i])]=gf(b[i]);
        }
        if(!ok)puts("-1");
    }
    return 0;
}