huu 1251

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <utility>
 #include <vector>
 #include <map>
 #include <queue>
 #include <stack>
 #include <cstdlib>
 #include <deque>
 #include <set>
 typedef long long ll;
 #define lowbit(x) (x&(-x))
 #define ls l,m,rt<<1
 #define rs m+1,r,rt<<1|1
 using namespace std;
 const  int N=1e6+;
 int tree[N][];//26个字母
 int num[N];
 char s[];
 int pos;
 void insert(char s[]){
     int root=,i;
     for(i=;s[i];i++){
         int x=s[i]-'a';
         if(!tree[root][x]){
             tree[root][x]=pos++;
         }
         root=tree[root][x];
         num[root]++;
     }
 }
 int  query(char s[]){
     int i;
     int root=;
     for(i=;s[i];i++){
         int x=s[i]-'a';
         if(!tree[root][x]){
             return  ;
         }
         root=tree[root][x];
     }
     return num[root];
 }
 int main()
 {
    pos=;
    /*
     memset(tree,0,sizeof(tree));
     memset(num,0,sizeof(num));
     */
     //加上上面的会超内存
     while(gets(s)){//不要用scanf
         if(s[]==NULL)
             break;
             insert(s);
     }
     while(gets(s)){
         printf("%d\n",query(s));
     }
     return  ;
 }