#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

struct DSU {
    std::vector<int> f, siz;
    
    DSU() {}
    DSU(int n) {
        init(n);
    }
    
    void init(int n) {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
    
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    
    int size(int x) {
        return siz[find(x)];
    }
};

vector<int> vec;
unordered_map<int,int> st;
unordered_map<int,vector<PII>> edge;
int fg=0;
void dfs(int cur,int fa)
{
	st[cur]=1;
	for(auto z:edge[cur])
	{
		if(z.fi == fa) continue;
		if(st[z.fi]==1 and fg==0)
		{
			fg=z.fi;
			return;
		}

		if(fg==0)
		{
			dfs(z.fi,cur);
		}
		
		if(fg!=0)
		if(fg!=cur)
		{
			vec.pb(z.se);
		}
		else if(fg==cur)
		{
			vec.pb(z.se);
			fg=-1;
		}

	}
}

void solve()
{
    int n,m;
    cin>>n>>m;
	DSU dsu(2*n);
    edge.clear();

    int point = -1;
    for(int i=1;i<=m;i++)
    {
    	int a,b;
    	cin>>a>>b;
    	if(dsu.same(a,b))
    	{
    		edge[a].pb({b,i});
    		edge[b].pb({a,i});
    		point = a;
    		break;
    	}
    	edge[a].pb({b,i});
    	edge[b].pb({a,i});
    	dsu.merge(a,b);
    }

    if(point==-1) cout<<-1<<endl;

    st.clear();
    vec.clear();
    dfs(point,-1);
    sort(vec.begin(),vec.end());

    for(auto z:vec) 
   	{
   		cout<<z;
   		if(z!=*vec.rbegin()) cout<<' ';
   	}
    cout<<endl;

}

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