#include <cstdio>

#include <cstring>

#include <iostream>

using namespace std;

const int KIND = ;

const int MAX_N = ;

struct Node

{

    Node *next[];

    int count;

    Node ()

    {

        count = ;

        memset(next, , sizeof(next));

    }

};

void InsertTrie(Node *root, char *str)

{

    Node *p = root;

    int i = , k = ;

    while (str[i])

    {

        k = str[i] - 'a';

        if (!p->next[k])

            p->next[k] = new Node();

        p = p->next[k];

        p->count++;

        ++i;

    }

}

int Find(Node *root, char *str)

{

    int i = , k = ;

    Node *p = root;

    while (str[i])

    {

        k = str[i] - 'a';

        if (!p->next[k])

            return ;

        p = p->next[k];

        ++i;

    }

    return p->count;

}

int main()

{

    int ans = ;

    char str[MAX_N];

    Node *root = new Node();

    while (gets(str) && strcmp(str,"") != )

        InsertTrie(root, str);

    while (gets(str))

    {

        ans = Find(root, str);

        printf("%d\n", ans);

    }

    return ;

}