#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <cstring>
#include <ctime>
#include <cassert>

using namespace std;

#define MAXA 1000050
#define MAXB 10050
char A[MAXA], B[MAXB];
int pr[MAXA];
int N, k, nr;

int main() {
	freopen("ahocorasick.in", "r", stdin);
	freopen("ahocorasick.out","w", stdout);

    fgets(A, sizeof(A), stdin);

    scanf("%d\n", &N);
    while(N--) {
        fgets(B, sizeof(B), stdin);

        pr[0] = -1;
        k = -1;
        for(int i = 1; B[i] != '\n' && B[i] != '\0'; i++) {
            while(k > -1 && B[i] != B[k + 1])
                k = pr[k];

            if(B[i] == B[k + 1])
                k++;
        }

        nr = 0;
        k = -1;
        for(int i = 0; A[i] != '\n' && A[i] != '\0'; i++) {
            while(k > -1 && A[i] != B[k + 1])
                k = pr[k];

            if(A[i] == B[k + 1])
                k++;

            if(B[k + 1] == '\n' || B[k + 1] == '\0')
                nr++;
        }

        printf("%d\n", nr);
    }

	return 0;
}