#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 1e5 + 5;

struct qwq{
	int nxt,to,val;
};
qwq edge[N * 2];

int n,m,T,num,x,y,cnt, tx, ty;
int fa[N],head[N],p[N],vis[N],pre[N],ans[N];

void addedge(int f,int t,int v)
{
	edge[++ cnt].nxt = head[f];
	edge[cnt].to = t;
	edge[cnt].val = v;
	head[f] = cnt;
}

int getfa(int x)
{
	if(fa[x] != x) fa[x] = getfa(fa[x]);
	return fa[x];
}

int dfs(int now,int f,int tar)
{
	//printf("now = %d\n",now);
	if(vis[now]) return 0;
	vis[now] = 1;
	if(now == tar)
	{
		return 1;
	}
	for(int i = head[now];i;i = edge[i].nxt)
	{
		int t = edge[i].to;
		if(t == f || vis[t]) continue;
		if(dfs(t,now,tar))
		{
			p[++ num] = edge[i].val;
			return 1;
		}
	}
}

void bfs()
{
	queue <int> q;
	while(!q.empty()) q.pop();
	q.push(x);
	while(! q.empty())
	{
		int now = q.front();
		q.pop();
		for(int i = head[now];i;i = edge[i].nxt)
		{
			int t = edge[i].to;
			if(t == pre[now]) continue;
			pre[t] = now;
			ans[t] = edge[i].val;
			q.push(t);
		}
	}
}

int main()
{
	int T; 
	scanf("%d",&T);
	while(T --)
	{
		scanf("%d%d",&n,&m);
		int flag = 0;
		num = 0; cnt = 0;
		for(int i = 1;i <= n;i ++)
			fa[i] = i;
		memset(head,0,sizeof(int) * n);
		for(int i = 1;i <= m;i ++)
		{
			scanf("%d%d",&x,&y);
			if(flag) continue;
			if(getfa(x) == getfa(y))
			{
				p[++ num] = i;
				//dfs(x,0,y);
				bfs();
				tx = x;
				ty = y;
				flag = 1;
			}
			else
			{
				addedge(x,y,i);
				addedge(y,x,i);
				fa[getfa(x)] = getfa(y);
			}
		}
		if(num)
		{
			int now = ty;
			while(now != tx)
			{
				//printf("now = %d\n",now);
				p[++ num] = ans[now];
				now = pre[now];
			}
			sort(p + 1,p + num + 1);
			for(int i = 1;i < num;i ++)
				printf("%d ",p[i]);
			printf("%d\n",p[num]);
		}
		else printf("-1\n");
	}
	return (0 ^ 0);
}