#include<iostream>

#include<algorithm>

#include<ctype.h>

#include<string>

#include<string.h>

#include<fstream>

#include<vector>

#include<queue>

#include"iomanip"

using namespace std;

string p[],r[];

bool test(string url)        //URL地址合法性检测

{

    if(url[] != '/')    return false;    

    for(int i=;i<url.length();i++)

    {

        if( (url[i]>='a' && url[i]<='z') || (url[i]>='A' && url[i]<='Z') || (url[i]>='' && url[i]<='') || url[i]=='/' || url[i]=='-' || url[i]=='_' || url[i]=='.')

            continue;

        else

            return false;

    }

    return true;

}

bool match_str(string url)            //str参数匹配

{

    for(int i=;i<url.length();i++)

    {

        if( (url[i]>='a' && url[i]<='z') || (url[i]>='A' && url[i]<='Z') || (url[i]>='' && url[i]<='') || url[i]=='-' || url[i]=='_' || url[i]=='.')

            continue;

        else

            return false;

    }

    return true;

}

bool match_int(string url)

{

    for(int i=;i<url.length();i++)

    {

        if( (url[i]>='' && url[i]<='') )

            continue;

        else

            return false;

    }

    return true;

}

bool match_path(string url)

{

    for(int i=;i<url.length();i++)

    {

        if( (url[i]>='a' && url[i]<='z') || (url[i]>='A' && url[i]<='Z') || (url[i]>='' && url[i]<='') || url[i]=='/' || url[i]=='-' || url[i]=='_' || url[i]=='.')

            continue;

        else

            return false;

    }

    return true;

}

bool match(string url,string p,string r)    //url地址与p规则匹配检测

{

    //cout<<endl;

    string s1[],s2[];

    int x=,y=;

    int first = -,second = -;

    for(int i=;i<p.length();i++)    //拆分规则p

    {

        if(p[i] == '/' && first == - )                    first = i;

        else if(p[i] == '/' && first != - && second == -)

        {

            second = i;

            s1[x] = p.substr(first+,second-first-);

            //cout<<s1[x]<<endl;

            x++;

            first = i;

            second = -;

        }

        else if(i == p.length()- && p[i]!='/')

        {

            second = i+;

            s1[x] = p.substr(first+,second-first-);

            //cout<<s1[x]<<endl;

            x++;

        }

    }

    //cout<<endl;

    first = -,second = -;

    for(int i=;i<url.length();i++)        //拆分url

    {

        if(url[i] == '/' && first == - )                    first = i;

        else if(url[i] == '/' && first != - && second == -)

        {

            second = i;

            s2[y] = url.substr(first+,second-first-);

            //cout<<s2[y]<<endl;

            y++;

            first = i;

            second = -;

        }

        else if(i == url.length()- && url[i]!='/')

        {

            second = i+;

            s2[y] = url.substr(first+,second-first-);

            //cout<<s2[y]<<endl;

            y++;

        }

    }

    int k=,i,j;

    r += " ";

    for(i=;i<x;i++)

    {

        if(s1[i] == "<str>")

        {

            if(match_str(s2[k]) == true)

            {

                r += s2[k] + " ";

                k++;

            }

            else

                break;

        }

        else if(s1[i] == "<int>")

        {

            if(match_int(s2[k]) == true)

            {

                for(j=;j<s2[k].length();j++)

                {

                    if(s2[k][j] != '')

                        break;

                }

                r += s2[k].substr(j) + " ";

                k++;

            }

            else                            break;

        }

        else if(s1[i] == "<path>")

        {

            for(j=k;j<y;j++)

            {

                if(j != y-)    r += s2[j] +"/";

                else            r += s2[j];

            }

            cout<<r<<endl;

            return true;

        }

        else

        {

            if(s1[i] == s2[k])

            {

                k++;

            }

            else                    return false;

        }

        if(k == y)    break;

    }

    if(k == y && i == x-)

    {

        if((url[url.length()-] == '/' &&  p[p.length()-] != '/') || (url[url.length()-] != '/' &&  p[p.length()-] == '/'))

        {

            //坑点一 : 占了40分，结尾的 / 不是分割符，是属于路径名 (题目未保证最后以/结尾)。 因为是采取以分割符进行分块处理的做法，所以在结尾要判断分割符。

            return false;

        }

        cout<<r<<endl;

        return true;

    }

    return false;

}

int main()

{

    int n,m;

    scanf("%d %d",&n,&m);

    for(int i=;i<n;i++)

    {

        cin>>p[i]>>r[i];

    }

    for(int i=;i<m;i++)

    {

        string url;

        cin>>url;

        if(test(url) == false)

        {

            cout<<""<<endl;

            continue;

        }

        int j;

        for(j=;j<n;j++)

        {

            if(match(url,p[j],r[j]) == true)

            {

                break;

            }

        }

        if(j == n)    cout<<""<<endl;

    }

    return ;

}