//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;

int n,indx[105];
string s,t;

struct Trie{
    int app[26],counter,trail;
    vector<int>adj;
    Trie(){
        for(int i=0;i<=25;i++) app[i]=0;
        counter = trail = 0;
    }
}tz;

vector<Trie>vecc;

int add(string aux){
    int curr=0;
    for(int i=0;i<aux.size();i++){
        int c=(aux[i]-'a');
        if(vecc[curr].app[c]){
            curr=vecc[curr].app[c];
        }
        else{
            vecc[curr].app[c]=vecc.size();
            curr=vecc.size();
            vecc.push_back(tz);
        }
    }
    return curr;
}

void BFS(){
    queue<int>q;
    q.push(0);
    while(q.size()){
        int curr=q.front();
        for(int i=0;i<=25;i++){
            if(vecc[curr].app[i]){

                q.push(vecc[curr].app[i]);
                int aux=vecc[curr].trail;
                while(true){
                    if(vecc[aux].app[i] && aux!=curr){
                        vecc[vecc[curr].app[i]].trail=vecc[aux].app[i];
                        vecc[vecc[aux].app[i]].adj.push_back(vecc[curr].app[i]);
                        break;
                    }
                    if(aux==0){
                        vecc[0].adj.push_back(vecc[curr].app[i]);
                        break;
                    }
                    aux=vecc[aux].trail;
                }
            }
        }
        q.pop();
    }
}

void DFS(int s){
    for(auto it:vecc[s].adj){
        DFS(it);
        vecc[s].counter+=vecc[it].counter;
    }
}

int32_t main(){
   // ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("ahocorasick.in");
    ofstream cout("ahocorasick.out");
    cin >> s >> n;
    vecc.push_back(tz);
    for(int i=1;i<=n;i++){
        cin >> t;
        indx[i]=add(t);
    }
    BFS();
    int curr=0;
    for(int i=0;i<s.size();i++){
        int c=(s[i]-'a');
        if(vecc[curr].app[c]) curr=vecc[curr].app[c];
        else{
            while(true){
                curr=vecc[curr].trail;
                if(vecc[curr].app[c]){
                    curr=vecc[curr].app[c];
                    break;
                }
                if(curr==0) break;
            }
        }
        vecc[curr].counter++;
    }
    DFS(0);
    for(int i=1;i<=n;i++) cout << vecc[indx[i]].counter << '\n';
}