// Sử dụng Suffix Array công thức sum theo từng tâm
#include <bits/stdc++.h>
using namespace std;
int main() {
    string s;
    cin >> s;
    int n = s.size();
    int q; cin >> q;
    if (n == 0) { 
        while(q--) cout << 0 << endl;
        return 0; 
    }
    // Suffix Array
    vector<int> sa(n), rank(n), tmp(n);
    for (int i = 0; i < n; i++) { sa[i] = i; rank[i] = s[i]; }
    for (int k = 1; k < n; k *= 2) {
        auto cmp = [&](int a, int b) {
            if (rank[a] != rank[b]) return rank[a] < rank[b];
            int ra = (a + k < n) ? rank[a + k] : -1;
            int rb = (b + k < n) ? rank[b + k] : -1;
            return ra < rb;
        };
        sort(sa.begin(), sa.end(), cmp);
        tmp[sa[0]] = 0;
        for (int i = 1; i < n; i++)
            tmp[sa[i]] = tmp[sa[i-1]] + cmp(sa[i-1], sa[i]);
        rank = tmp;
    }
    vector<int> lcp(n, 0), inv(n);
    for (int i = 0; i < n; i++) inv[sa[i]] = i;
    int k = 0;
    for (int i = 0; i < n; i++) {
        if (inv[i] == n - 1) { k = 0; continue; }
        int j = sa[inv[i] + 1];
        while (i + k < n && j + k < n && s[i + k] == s[j + k]) k++;
        lcp[inv[i]] = k;
        if (k > 0) k--;
    }
    vector<int> cnt(26, 0);
    for (int i = 0; i < n; i++) {
        char c = s[sa[i]];
        int len = n - sa[i];
        int prev = (i > 0) ? lcp[i-1] : 0;
        cnt[c - 'a'] += len - prev;
    }
    while (q--) {
        char c; cin >> c;
        cout << cnt[c-'a'] << endl;
    }
    return 0;
}