#include <bits/stdc++.h>
using namespace std;

const int N = 205;
const int M = 6005;
const int L = 1e6 + 5;
const int inf = 1e9;

int n, m, top, tot, tot2, s, t, h[N * 2], h2[N], lv[N * 2], cur[N * 2], pre[N * 2], cnt[M * 2], ans[L];
queue<int> q;

struct Edge {
	int v, w, nxt;
} e[M * 2], e2[L];

void add(int u, int v, int w) {
	e[++tot].v = v;
	e[tot].w = w;
	e[tot].nxt = h[u];
	h[u] = tot;
}

void add2(int u, int v) {
	e2[++tot2].v = v;
	e2[tot2].nxt = h2[u];
	h2[u] = tot2;
}

bool bfs() {
	memset(lv, -1, sizeof(lv));
	lv[s] = 0;
	q.push(s);
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = h[u]; i; i = e[i].nxt) {
			int v = e[i].v, w = e[i].w;
			if (lv[v] == -1 && w > 0) {
				lv[v] = lv[u] + 1;
				q.push(v);
			}
		}
	}
	return ~lv[t];
}

int dfs(int u, int mn) {
	if (u == t) {
		return mn;
	}
	int res = 0;
	for (int &i = cur[u]; i; i = e[i].nxt) {
		int v = e[i].v, w = e[i].w;
		if (lv[v] == lv[u] + 1 && w > 0) {
			int f = dfs(v, min(mn, w));
			e[i].w -= f;
			e[i ^ 1].w += f;
			mn -= f;
			res += f;
			if (!mn) {
				break;
			}
		}
	}
	if (!res) {
		lv[u] = -1;
	}
	return res;
}

int Dinic() {
	int res = 0;
	while (bfs()) {
		for (int i = 1; i <= t; i++) {
			cur[i] = h[i];
		}
		res += dfs(s, inf);
	}
 	return res;
}

void euler(int u) {
	for (int &i = h2[u]; i;) {
		int v = e2[i].v;
		i = e2[i].nxt;
		euler(v);
	}
	ans[++top] = u;
}

void work(int test_case) {
	cout << "Case #" << test_case << ": ";
	cin >> n >> m;
	tot = 1;
	tot2 = 0;
	top = 0;
	s = n * 2 + 1;
	t = n * 2 + 2;
	for (int i = 1; i <= t; i++) {
		h[i] = 0;
		h2[i] = 0;
	}
	for (int i = 2; i <= m * 2 + n * 4 + 1; i++) {
		cnt[i] = 0;
	}
	for (int u = 1; u <= n; u++) {
		add(s, u, 1);
		add(u, s, 0);
		add(u + n, t, 1);
		add(t, u + n, 0);
	}
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		add(u, v + n, 1);
		add(v + n, u, 0);
	}
	if (Dinic() < n) {
		cout << "IMPOSSIBLE\n";
		return;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = h[i]; j; j = e[j].nxt) {
			int v = e[j].v;
			if (v > n && v < s && !e[j].w) {
				cnt[j] += m - n + 1;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			pre[j] = 0;
		}
		pre[i + n] = -1;
		q.push(i + n);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			for (int j = h[u]; j; j = e[j].nxt) {
				int v = e[j].v, w = e[j].w;
				if (!w || v >= s) {
					continue;
				}
				if (pre[v]) {
					if (v == i + n) {
						cnt[j]++;
						for (int x = u; x != i + n; x = e[pre[x] ^ 1].v) {
							if (x > n) {
								cnt[pre[x]]++;
							}
							else {
								cnt[pre[x] ^ 1]--;
							}
						}
					}
					continue;
				}
				pre[v] = j;
				q.push(v);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = h[i]; j; j = e[j].nxt) {
			int v = e[j].v;
			if (v > n && v < s && !cnt[j]) {
				cout << "IMPOSSIBLE\n";
				return;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = h[i]; j; j = e[j].nxt) {
			while (cnt[j]--) {
				add2(i, e[j].v - n);
			}
		}
	}
	euler(1);
	cout << top << '\n';
	while (top) {
		cout << ans[top--] << ' ';
	}
	cout << '\n';
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int T; cin >> T; for (int i = 1; i <= T; i++) work(i);

	return 0;
}