Professor Pathfinder is a distinguished authority on the structure of hyperlinks in the World Wide Web. For establishing his hypotheses, he has been developing software agents, which automatically traverse hyperlinks and analyze the structure of the Web. Today, he has gotten an intriguing idea to improve his software agents. However, he is very busy and requires help from good programmers. You are now being asked to be involved in his development team and to create a small but critical software module of his new type of software agents.

Upon traversal of hyperlinks, Pathfinder’s software agents incrementally generate a map of visited portions of the Web. So the agents should maintain the list of traversed hyperlinks and visited web pages. One problem in keeping track of such information is that two or more different URLs can point to the same web page. For instance, by typing any one of the following five URLs, your favorite browsers probably bring you to the same web page, which as you may have visited is the home page of the ACM ICPC Ehime contest.


http://www.ehime-u.ac.jp/ICPC/
http://www.ehime-u.ac.jp/ICPC
http://www.ehime-u.ac.jp/ICPC/../ICPC/
http://www.ehime-u.ac.jp/ICPC/./
http://www.ehime-u.ac.jp/ICPC/index.html


Your program should reveal such aliases for Pathfinder’s experiments.

Well, . . . but it were a real challenge and to be perfect you might have to embed rather compli- cated logic into your program. We are afraid that even excellent programmers like you could not complete it in five hours. So, we make the problem a little simpler and subtly unrealis- tic. You should focus on the path parts (i.e. /ICPC/, /ICPC, /ICPC/../ICPC/, /ICPC/./, and /ICPC/index.html in the above example) of URLs and ignore the scheme parts (e.g. http://), the server parts (e.g. www.ehime-u.ac.jp), and other optional parts. You should carefully read the rules described in the sequel since some of them may not be based on the reality of today’s Web and URLs.

Each path part in this problem is an absolute pathname, which specifies a path from the root directory to some web page in a hierarchical (tree-shaped) directory structure. A pathname always starts with a slash (/), representing the root directory, followed by path segments delim- ited by a slash. For instance, /ICPC/index.html is a pathname with two path segments ICPC and index.html.

All those path segments but the last should be directory names and the last one the name of an ordinary file where a web page is stored. However, we have one exceptional rule: an ordinary file name index.html at the end of a pathname may be omitted. For instance, a pathname /ICPC/index.html can be shortened to /ICPC/, if index.html is an existing ordinary file name. More precisely, if ICPC is the name of an existing directory just under the root and index.html is the name of an existing ordinary file just under the /ICPC directory, /ICPC/index.html and /ICPC/ refer to the same web page. Furthermore, the last slash following the last path segment can also be omitted. That is, for instance, /ICPC/ can be further shortened to /ICPC. However, /index.html can only be abbreviated to / (a single slash).

You should pay special attention to path segments consisting of a single period (.) or a double period (..), both of which are always regarded as directory names. The former represents the directory itself and the latter represents its parent directory. Therefore, if /ICPC/ refers to some web page, both /ICPC/./ and /ICPC/../ICPC/ refer to the same page. Also /ICPC2/../ICPC/ refers to the same page if ICPC2 is the name of an existing directory just under the root; otherwise it does not refer to any web page. Note that the root directory does not have any parent directory and thus such pathnames as /../ and /ICPC/../../index.html cannot point to any web page.

Your job in this problem is to write a program that checks whether two given pathnames refer to existing web pages and, if so, examines whether they are the same.



Input

The input consists of multiple datasets. The first line of each dataset contains two positive integers N and M, both of which are less than or equal to 100 and are separated by a single space character.

The rest of the dataset consists of N + 2M lines, each of which contains a syntactically correct pathname of at most 100 characters. You may assume that each path segment enclosed by two slashes is of length at least one. In other words, two consecutive slashes cannot occur in any pathname. Each path segment does not include anything other than alphanumerical characters (i.e. ‘a’-‘z’, ‘A’-‘Z’, and ‘0’-‘9’) and periods (‘.’).

The first N pathnames enumerate all the web pages (ordinary files). Every existing directory name occurs at least once in these pathnames. You can assume that these pathnames do not include any path segments consisting solely of single or double periods and that the last path segments are ordinary file names. Therefore, you do not have to worry about special rules for index.html and single/double periods. You can also assume that no two of the N pathnames point to the same page.

Each of the following M pairs of pathnames is a question: do the two pathnames point to the same web page? These pathnames may include single or double periods and may be terminated by a slash. They may include names that do not correspond to existing directories or ordinary files.

Two zeros in a line indicate the end of the input.

Output

For each dataset, your program should output the M answers to the M questions, each in a separate line. Each answer should be “yes” if both point to the same web page, “not found” if at least one of the pathnames does not point to any one of the first N web pages listed in the input, or “no” otherwise.

Example

Input

5 6
/home/ACM/index.html
/ICPC/index.html
/ICPC/general.html
/ICPC/japanese/index.html
/ICPC/secret/confidential/2005/index.html
/home/ACM/
/home/ICPC/../ACM/
/ICPC/secret/
/ICPC/secret/index.html
/ICPC
/ICPC/../ICPC/index.html
/ICPC
/ICPC/general.html
/ICPC/japanese/.././
/ICPC/japanese/./../
/home/ACM/index.html
/home/ACM/index.html/
1 4
/index.html/index.html
/
/index.html/index.html
/index.html
/index.html/index.html
/..
/index.html/../..
/index.html/
/index.html/index.html/..
0 0


Output

not found
not found
yes
no
yes
not found
not found
yes
not found
not found
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>

using namespace std;

struct Node{
    string name;
    map<string,Node*> msn;
    Node *par;
    int num;
    Node(){
        num=0;
    }
};

int idx;


void parse(string s,Node *node){
    string name;
    string left;
    for(int i = 0; i < s.size(); i++){
        if(s[i]=='/'){
            name=s.substr(0,i);
            left=s.substr(i+1);
            break;
        }
        else if(i==s.size()-1){
            name=s;
            break;
        }
    }
    if(node->msn.find(name)==node->msn.end()){
        Node *nd = new Node();
        nd->name=name;
        nd->par=node;
        node->msn[name]=nd;
        // t@CÉÍidðÂ¯Ä¯Ê
        if(left==""){
            //if(idx==3){
            //    cout<<endl;
            //}
            nd->num=idx++;
        }
    }
    // Ü¾¶ªcÁÄ¢êÎAÄA
    if(left!="")
        parse(left,node->msn[name]);
}

// ßêéæ¤Éem[hÖÌQÆàÁÄ¨­
int search(Node *node,string path){
    if(node==NULL)return 0;
    // t@CÌêÜÅB
    if(node->num!=0)
        return node->num;
    // ±±ÅpXªóÉÈÁ½
    if(path==""){
        // indexªºÉ é©Å»f
        if(node->msn.find("index.html")==node->msn.end())
            return 0;
        return node->msn["index.html"]->num;
    }
    string name;
    string left;
    bool isFile=false;
    for(int i = 0; i < path.size(); i++){
        if(path[i]=='/'){
            name=path.substr(0,i);
            left=path.substr(i+1);
            break;
        }
        else if(i==path.size()-1){
            isFile=true;
            name=path;
            break;
        }
    }
    if(!isFile&&node->msn.find(name)!=node->msn.end()&&node->msn[name]->num!=0){
        return 0;
    }

    // ÅºwÌfBNg é¢Ít@Cð¦·
    if(name=="..")
        return search(node->par,left);
    else if(name==".")
        return search(node,left);
    // ÄA
    if(node->msn.find(name)==node->msn.end())
        return 0;
    return search(node->msn[name],left);
}

int main(){

    int n,m;
    while(cin>>n>>m&&!(n==0&&m==0)){
        idx=1;
        Node *root = new Node();
        root->name+='/';
        root->par=NULL;
        for(int i = 0; i < n; i++){
            string s;
            cin>>s;
            parse(s.substr(1),root);
        }
        for(int i = 0; i < m; i++){
            string s1,s2;
            cin>>s1>>s2;
            int res1=search(root,s1.substr(1));
            int res2=search(root,s2.substr(1));
            if(res1==0||res2==0)cout<<"not found"<<endl;
            else if(res1==res2)cout<<"yes"<<endl;
            else cout<<"no"<<endl;
        }
    }

    return 0;
}