The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of template procedures. The next n lines contain the description of the procedures specified in the following format:

"void procedureName (type_1, type_2, ..., type_t)" (1 ≤ t ≤ 5), where void is the keyword, procedureName is the procedure name, type_i is the type of the next parameter. Types of language parameters can be "int", "string", "double", and the keyword "T", which denotes the generic type.

The next line contains a single integer m (1 ≤ m ≤ 1000) — the number of used variables. Next m lines specify the description of the variables in the following format:

"type variableName", where type is the type of variable that can take values "int", "string", "double", variableName — the name of the variable.

The next line contains a single integer k (1 ≤ k ≤ 1000) — the number of procedure calls. Next k lines specify the procedure calls in the following format:

"procedureName (var_1, var_2, ..., var_t)" (1 ≤ t ≤ 5), where procedureName is the name of the procedure, var_i is the name of a variable.

The lines describing the variables, template procedures and their
calls may contain spaces at the beginning of the line and at the end of
the line, before and after the brackets and commas. Spaces may be before
and after keyword void. The length of each input line does not exceed 100
characters. The names of variables and procedures are non-empty strings
of lowercase English letters and numbers with lengths of not more than 10
characters. Note that this is the only condition at the names. Only the
specified variables are used in procedure calls. The names of the
variables are distinct. No two procedures are the same. Two procedures
are the same, if they have identical names and identical ordered sets of
types of their parameters.

Output

On each of k lines print a single number, where the i-th number stands for the number of suitable template procedures for the i-th call.

Examples

4
void f(int,T)
void  f(T, T)
 void foo123   ( int,  double,  string,string  ) 
  void  p(T,double)
3
int a
 string    s
double x123 
5
f(a,  a)
  f(s,a   )
foo   (a,s,s)
 f  (  s  ,x123)
proc(a)

2
1
0
1
0

6
void f(string,double,int)
void f(int)
   void f  ( T  )
void procedure(int,double)
void f  (T, double,int)   
void f(string, T,T)
4
 int a
 int x
string  t
double  val  
5
f(t, a, a)
f(t,val,a)
f(val,a, val)
 solve300(val, val)
f  (x)

1
3
0
0
2

#include <iostream>

#include <cstring>

#include <cstdio>

#include <algorithm>

#include <map>

#include <string>

#define rep(i, j, k) for(int i = j; i <= k; i++)

#define maxn 1000009

#define ll long long

using namespace std;

int n, m, k;

map <string, string> mp;

struct cadongllas

{

    int num;

    string var[];

    string name;

}ask[], funk[];

bool equal (cadongllas x, cadongllas y)

{

    if (x.num != y.num)

        return ;

    if (x.name != y.name)

        return ;

    rep (i, , x.num)

        if (x.var[i] != y.var[i] && x.var[i] != "T")

            return ;

    return ;

}

int main ()

{

    cin >> n;

    rep (i, , n)

    {

        char blank[];

        scanf ("%s", blank);

        //if (blank[strlen (blank) - 1] == '(') blank[ strlen (blank) - 1] = 0; ask[i].name = string (blank); cout << ask[i].name << endl;

        while ()

        {

            char ch = getchar ();

            if (ch == '(')

                break;

            if (ch != ' ')

            ask[i].name += ch;

        }

        //cout << ask[i].name << endl;

        string s;

        getline (cin, s);

        int len = s.length ();

        int now = ;

        while ()

        {

            while ((s[now] == ')' || s[now] == ',' || s[now] == ' ' ) && now < len)

                now++;

            if (now >= len)

                break;

            string nex;

            while ()

            {

                nex += s[now++];

                if (s[now] == ')' || s[now] == ',' || s[now] == ' ' || now >= len)

                    break;

            }

            ask[i].var[ ++ ask[i].num] = nex;

            //cout << "----" << nex << endl;

            if (s[now] == ')')

                break;

        }

    }

    //rep (i, 1, n) { printf ("%d %d\n", i, ask[i].num); rep (j, 1, ask[i].num) cout << ask[i].var[j] << endl; }

    cin >> m;

    rep (i, , m)

    {

        string sa, sb;

        cin >> sa >> sb;

        mp[sb] = sa;

    }

    cin >> k;

    getchar ();

    rep (i, , k)

    {

        while ()

        {

            char ch = getchar ();

            if (ch == '(')

                break;

            if (ch != ' ')

                funk[i].name += ch;

        }

        //cout << "name" << funk[i].name << endl;

        string s;

        getline (cin, s);

        int len = s.length (), now = ;

        while ()

        {

            while ((s[now] == ')' || s[now] == ',' || s[now] == ' ' ) && now < len)

                now++;

            if (now >= len)

                break;

            string nex;

            while ()

            {

                nex += s[now++];

                if (s[now] == ')' || s[now] == ',' || s[now] == ' ' || now >= len)

                    break;

            }

            funk[i].var[ ++ funk[i].num] = mp[nex];

            //cout << "----" << nex << endl;

            if (s[now] == ')')

                break;

        }

        //rep (p, 1, funk[i].num) cout << "===" << funk[i].var[p] << "===" << endl;

        int ans = ;

        rep (j, , n)

            if (equal (ask[j], funk[i]))

                ans++;

        cout << ans << endl;

    }

    return ;

}