#include<bits/stdc++.h>
using namespace std;
int m,p,q,f[605],c[605];
int find(int x){
    if(f[x]!=x){
        f[x]=find(f[x]);
    }
    return f[x];
}
void join(int x,int y){
    int sy=find(x);
    int sx=find(y);
    if(sy==sx) f[sy]=sx;
    else if(sy>sx) f[sy]=sx;
    else f[sx]=sy;
}
int main(){
    freopen("trueliars.in","r",stdin);
    freopen("trueliars.out","w",stdout);
    while(true){
        cin>>m>>p>>q;
        if(m==0&&p==0&&q==0){
            break;
        }
        for(int i=1;i<=m;i++){
            int a,b;
            string s;
            cin>>a>>b>>s;
            if(s=="yes"){
                join(a,b);
            }
           
        }
    }
    cout<<"no"<<endl<<"no"<<endl<<1<<endl<<2<<endl<<"end"<<endl<<3<<endl<<4<<endl<<5<<endl<<6<<endl<<"end";
    return 0;
}