#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<int> edge[405];
int eid[205][205];
int vis[405];
int ex[5005],ey[5005];
int to[405];
int num[5005];
int mat[205][205];
int dfs(int x){
	vis[x]=1;
	for(int y:edge[x])if(!to[y]){to[x]=y,to[y]=x;return 1;}
	for(int y:edge[x])if(!vis[to[y]]&&dfs(to[y])){to[x]=y,to[y]=x;return 1;}
	return 0;
}
stack<int> st;
void solve(int x){
	for(int y=1;y<=n;y++)if(mat[x][y])mat[x][y]--,solve(y);
	st.push(x);
}
int main(){
	int _;scanf("%d",&_);
	for(int __=1;__<=_;__++){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=2*n;i++)edge[i].clear();
		memset(num,0,sizeof(num));
		memset(to,0,sizeof(to));
		memset(mat,0,sizeof(mat));
		while(!st.empty())st.pop();
		for(int i=1;i<=m;i++){
			int x,y;scanf("%d%d",&x,&y);
			edge[x].push_back(y+n);
			edge[y+n].push_back(x);
			ex[i]=x,ey[i]=y;
			eid[x][y]=i;
		}
		int nosol=0;
		for(int i=1;i<=n;i++){
			memset(vis,0,sizeof(vis));
			if(!dfs(i)){nosol=1;break;}
		}
		if(nosol){printf("Case #%d: IMPOSSIBLE\n",__);continue;}
		for(int i=1;i<=n;i++)num[eid[i][to[i]-n]]++;
		for(int i=1;i<=m;i++)if(!num[i]){
			memset(vis,0,sizeof(vis));
			int x=ex[i],y=ey[i]+n,tx=to[y],ty=to[x];
			to[x]=y,to[y]=x;vis[x]=1;
			to[tx]=to[ty]=0;
			if(!dfs(tx)){nosol=1;break;}
			for(int j=1;j<=n;j++)num[eid[j][to[j]-n]]++;
		}
		if(nosol){printf("Case #%d: IMPOSSIBLE\n",__);continue;}
		for(int i=1;i<=m;i++)mat[ex[i]][ey[i]]=num[i];
		solve(1);
		for(int i=1;i<=n&&!nosol;i++)
			for(int j=1;j<=n&&!nosol;j++)if(mat[i][j])nosol=1;
		if(nosol){printf("Case #%d: IMPOSSIBLE\n",__);continue;}
		printf("Case #%d: %d\n",__,st.size());
		while(!st.empty())printf("%d ",st.top()),st.pop();puts("");
	}
	return 0;
}