#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int N = 1010;const int M = 100010;struct Edge {    int from, to, next;} edge[M], edge2[M];int head[N];int cntE, cntE2;void addedge(int u, int v) {    edge[cntE].from = u; edge[cntE].to = v; edge[cntE].next = head[u]; head[u] = cntE++;}void addedge2(int u, int v) {    edge2[cntE2].from = u; edge2[cntE2].to = v; edge2[cntE2].next = head[u]; head[u] = cntE2++;}int dfn[N], low[N], idx;int stk[N], top;int in[N];int kind[N], cnt;void tarjan(int u){    dfn[u] = low[u] = ++idx;    in[u] = true;    stk[++top] = u;    for (int i = head[u]; i != -1; i = edge[i].next) {        int v = edge[i].to;        if (!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);        else if (in[v]) low[u] = min(low[u], dfn[v]);    }    if (low[u] == dfn[u]) {        ++cnt;        while (1) {            int v = stk[top--]; kind[v] = cnt; in[v] = false;            if (v == u) break;        }    }}int opp[N], ind[N], col[N]; // 相对的点 入度 染色 col[]=1选择bool topsort(int n) // 序号从0开始{    for (int i = 0; i < 2*n; i += 2) {        int k1 = kind[i]; int k2 = kind[i^1]; // 相对的两个的关系        //printf("%d %d %d %d\n", i, i^1, k1, k2);        if (k1 == k2) return false;        opp[k1] = k2; opp[k2] = k1;    }    memset(head, -1, sizeof head);    int u, v;    for (int i = 0; i < cntE; ++i) {        u = edge[i].from, v = edge[i].to;        if (kind[u] != kind[v]) { // 反向建图            addedge2(kind[v], kind[u]);            ind[kind[u]]++;        }    }    queue<int> q;    for (int i = 1; i <= cnt; ++i) if (!ind[i]) q.push(i);    while (q.size()) {        u = q.front(); q.pop();        if (!col[u]) col[u] = 1, col[ opp[u] ] = -1;        for (int i = head[u]; i != -1; i = edge2[i].next)            if (--ind[edge2[i].to] == 0) q.push(edge2[i].to);    }    return true;}void init() {    cntE = cntE2 = 0;    memset(head, -1, sizeof head);    memset(dfn, 0, sizeof dfn);    memset(in, false, sizeof in);    idx = top = cnt = 0;    memset(ind, 0, sizeof ind);    memset(col, 0, sizeof col);}int main() {    int n, m;    int u, v;    while (scanf("%d%d", &n, &m) == 2) {        if (n == 0 && m == 0)break;        init();        while (m--) {            //3h 7h            char s1, s2;            scanf("%d%c%d%c", &u, &s1, &v, &s2);            u = s1==‘w‘ ? u*2 : u*2+1;            v = s2==‘w‘ ? v*2 : v*2+1;            if (!u || !v) continue;            addedge(u, v^1);            addedge(v, u^1);        }        addedge(0, 1);        for (int i = 0; i < 2 * n; ++i) {            if (!dfn[i]) tarjan(i);        }        if (topsort(n)) {            for (int i = 1; i < n; i++) {                if (col[ kind[2*i] ] == 1) printf("%dh", i);                else printf("%dw", i);                if (i < n - 1) printf(" ");                else printf("\n");            }        } else printf("bad luck\n");    }    return 0;}