#include "cstdio"

#include "cstring"

#include "string"

#include "iostream"

#include "queue"

#include "vector"

#include "algorithm"

using namespace std;

#define maxn 130

struct Trie

{

    Trie *next[maxn],*fail;

    int cnt;

}*root;

struct status

{

    Trie *last;

    int cnt;

    status(Trie *last,int cnt):last(last),cnt(cnt) {}

};

Trie *newnode()

{

    Trie *ret=new Trie;

    memset(ret->next,,sizeof(ret->next));

    ret->fail=;

    ret->cnt=;

    return ret;

}

void init() {root=newnode();}

void Insert(string str,int index)

{

    Trie *pos=root;

    for(int i=;i<str.size();i++)

    {

        int c=str[i];

        if(!pos->next[c]) pos->next[c]=newnode();

        pos=pos->next[c];

    }

    pos->cnt=index;

}

void getfail()

{

    queue<Trie *> Q;

    for(int c=;c<maxn;c++)

    {

        if(root->next[c])

        {

            root->next[c]->fail=root;

            Q.push(root->next[c]);

        }

        else root->next[c]=root;

    }

    while(!Q.empty())

    {

        Trie *x=Q.front();Q.pop();

        for(int c=;c<maxn;c++)

        {

            if(x->next[c])

            {

                x->next[c]->fail=x->fail->next[c];

                Q.push(x->next[c]);

            }

            else x->next[c]=x->fail->next[c];

        }

    }

}

vector<int> find(string str)

{

    Trie *pos=root,*last;

    queue<status> Q;

    vector<int> ans;

    for(int i=;i<str.size();i++)

    {

        int c=str[i];last;

        if(pos->next[c])

        {

            pos=pos->next[c];

            last=pos;

            while(last->cnt)

            {

                Q.push(status(last,last->cnt));

                ans.push_back(last->cnt);

                last->cnt=; //修改last->cnt

                last=last->fail;

            }

        }

    }

    while(!Q.empty()) //恢复last->cnt

    {

        status x=Q.front();Q.pop();

        x.last->cnt=x.cnt;

    }

    return ans;

}

int main()

{

    //freopen("in.txt","r",stdin);

    ios::sync_with_stdio(false);

    int n,m;

    string tt;

    while(cin>>n)

    {

        init();

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

        {

            cin>>tt;

            Insert(tt,i);

        }

        getfail();

        cin>>m;

        int cnt=;

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

        {

            cin>>tt;

            vector<int> ans=find(tt);

            sort(ans.begin(),ans.end());

            if(!ans.size()) continue;

            cnt++;

            printf("web %d:",i);

            for(int j=;j<ans.size();j++) printf(" %d",ans[j]);

            printf("\n");

        }

        printf("total: %d\n",cnt);

    }

}