不知道哪里错了，感觉是和P5782 [POI2001] 和平委员会 差不多的思路，但是从WA调试代码调到了UKE。。。

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

const int N = 1e6 + 10;
int h[N], e[N], ne[N], idx;
int dfn[N], low[N], ts;
int stk[N], top;
bool ins[N];
int id[N], scc_cnt;
int n, m, u, v;
char ch;

void init() {
	memset(h, -1, sizeof h);
	memset(dfn, 0, sizeof dfn);
	memset(low, 0, sizeof low);
	memset(stk, 0, sizeof stk);
	memset(id, 0, sizeof id);
	memset(ins, false, sizeof ins);
	ts = top = scc_cnt = idx = 0;
}

void add(int u, int v) {
	e[idx] = v, ne[idx] = h[u], h[u] = idx++;
}

void tarjan(int u) {
	dfn[u] = low[u] = ++ts;
	stk[++top] = u, ins[u] = true;
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (!dfn[v]) {
			tarjan(v);
			low[u] = min(low[u], low[v]);
		} else if (ins[v]) low[u] = min(low[u], dfn[v]);
	}
	
	if (low[u] == dfn[u]) {
		int v; scc_cnt++;
		do {
			v = stk[top--];
			ins[v] = false;
			id[v] = scc_cnt;
		} while (v != u);
	}
}
//强连通分量模板

int find(int x) {
	if (x >= n) return x - n;
	return x + n;
}

int main() {
	while (cin >> n >> m) {
		if (!n && !m) return 0;
		init();
		while (m--) {
			cin >> u >> ch; u += (ch == 'h') * n;
			cin >> v >> ch; v += (ch == 'h') * n;
			add(u, find(v));
			add(v, find(u));
            //通奸的一对不能在一起
		}
		add(0, n);
		for (int i = 0; i < n << 1; i++)
			if (!dfn[i]) tarjan(i);
		
		bool ans = true;
		for (int i = 0; i < n; i++)
			if (id[i] == id[i + n]) {
				ans = false;
				break;
			}
		
		if (!ans) {
			puts("bad luck");
			continue;
		}
		
		for (int i = 1; i < n; i++)
			if (id[i] < id[i + n]) printf("%dh ", i);
			else printf("%dw ", i);
		puts("");
	}
	return 0;
}