//RouteFinding

#include <iostream>

using namespace std;
const int MAXN = 105;

int T, N, st, en;
int matran[MAXN][MAXN], visit[MAXN];
int result;
void DFS(int v) {
	if (v == 99) {
		result = 1;
		return;
	}

	visit[v] = 1;
	for (int cand = 1; cand <= matran[v][0]; cand++) {
		if (visit[matran[v][cand]] == 0 && result == 0) {
			DFS(matran[v][cand]);
		}
	}
}


int main() {
	ios::sync_with_stdio(false);
	//freopen("input.txt", "r", stdin);
	for (int tc = 1; tc <= 10; tc++) {
		cin >> T >> N;
		for (int i = 0; i < MAXN; i++) {
			visit[i] = 0;
			matran[i][0] = 0;
		}

		for (int i = 0; i < N; i++) {
			cin >> st >> en;
			matran[st][++matran[st][0]] = en;
		}

		result = 0;
		DFS(0);
		cout << "#" << tc << " " << result << endl;
	}
	return 0;
}

#1 0
#2 0
#3 0
#4 0
#5 0
#6 0
#7 0
#8 0
#9 0
#10 0