#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;

inline int read() {
	int x = 0, f = 0;
	char c = getchar();
	while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
	while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
	return f? -x : x;
}

const int MAXN = 2e5;

struct SEG {
	int tot;
	int lc[MAXN*40+10], rc[MAXN*40 + 10], sum[MAXN*40+10];
	inline void pushup(int s) {
		sum[s] = sum[lc[s]] + sum[rc[s]];
	}
	void upd(int l, int r, int x, int v, int &s) {
		if (!s) s = ++tot;
		if (l == r) {sum[s] += v; return;}
		int mid = l + r >> 1;
		if (x <= mid) upd(l, mid, x, v, lc[s]);
		else upd(mid + 1, r, x, v, rc[s]);
		pushup(s);
	}
	int query(int l, int r, int L, int R, int s) {
		if (R < l || L > r || !s) return 0;
		if (L <= l && r <= R) return sum[s];
		int mid = l + r >> 1;
		return query(l, mid, L, R, lc[s]) + query(mid + 1, r, L, R, rc[s]);
	}
	int merge(int s1, int s2) {
		if (!s1 || !s2) {return s1 + s2;}
		int s = ++tot;
		lc[s] = lc[s1], rc[s] = rc[s1];
		sum[s] = sum[s1] + sum[s2];
		//if (l == r) return s;
		lc[s] = merge(lc[s1], lc[s2]);
		rc[s] = merge(rc[s1], rc[s2]);
		pushup(s);
		return s;
		//pushup(s);
	}
}seg;

namespace SAM {
    const int MAXS = MAXN*2;
	/*
	struct node{
		int x, p, v;
		inline node() {}
		inline node(int x_, int p_, int v_) {return x = x_, p = p_, v = v_;}
	};*/
    struct SAM {
        vector <int> G[MAXS];
        int ch[MAXS][28];
        int len[MAXS], sum[MAXS], fa[MAXS], rt[MAXS], last, tot;
        int extend(int c) {
            int np = ++tot, p = last; last = np;
            len[np] = len[p] + 1; sum[np] = 1;
            for (; p && !ch[p][c]; p = fa[p]) ch[p][c] = np;
            if (!ch[p][c]) {
                ch[p][c] = np;
                fa[np] = p;
                return np;
            }
            int q = ch[p][c];
            if (len[q] > len[p] + 1) {
                int nq = ++tot; len[nq] = len[p] + 1; fa[nq] = fa[q];
                for (int i = 0; i < 26; ++i) ch[nq][i] = ch[q][i];
                fa[np] = fa[q] = nq;
                for (; ch[p][c] == q; p = fa[p]) ch[p][c] = nq;
            }
            else fa[np] = q;
            return np;
        }

        int dfn[MAXS], siz[MAXS], tt;
        void dfs1(int x) {
            dfn[x] = ++tt; siz[x] = 1;
            for (auto v : G[x]) {
                dfs1(v);
				rt[x] = seg.merge(rt[x], rt[v]);
                siz[x] += siz[v];
				sum[x] += sum[v];
            }
		//	cerr << seg.query(1, s2.tt, s2.dfn[4], s2.dfn[4], rt[1]) << " ";
        }
        void build() {
            for (int i = 1; i <= tot; ++i)
                G[fa[i]].pb(i);
            dfs1(0);
        }
    };
}
SAM :: SAM s1, s2;

char s[MAXN + 10], t[MAXN + 10];
int pos1[MAXN + 10], pos2[MAXN + 10];

int main() {
	scanf("%s", s + 1);
	scanf("%s", t + 1);
	int n = strlen(s + 1);
	int m = strlen(t + 1);
	for (int i = 1; i <= n; ++i)
		pos1[i] = s1.extend(s[i] - 'a');
	for (int i = m; i >= 1; --i)
		pos2[i] = s2.extend(t[i] - 'a');
	s2.build();
	for (int i = 1; i <= n; ++i) {
		seg.upd(1, s2.tt, s2.dfn[pos2[i + 1]], 1, s1.rt[pos1[i]]);
		if (pos2[i + 1] == 4) {
			//cout << pos1[i] << " " << pos2[i + 1] << endl;
		}
	}
	//cerr << seg.query(1, s2.tt, s2.dfn[4], s2.dfn[4], s1.rt[4]) << endl;
	s1.build();
	//cerr << seg.query(1, s2.tt, s2.dfn[4], s2.dfn[4], s1.rt[7]) << endl;
	int Q = read();
	while (Q--) {
		static char str[MAXN + 10];
		static int p1[MAXN + 10], p2[MAXN + 10];
		scanf("%s", str + 1);
		int len = strlen(str + 1);
		int now1 = 0, now2 = 0;
		for (int i = 1; i < len; ++i) {
			now1 = p1[i] = s1.ch[now1][str[i] - 'a'];
			if (!now1) break;
		}
		for (int i = len; i > 1; --i) {
			now2 = p2[i] = s2.ch[now2][str[i] - 'a'];
			if (!now2) break;
		}
		ll ans = 0;
		for (int i = 1; i < len; ++i) {
			int p = p2[i + 1];
			if (!p1[i] || !p) continue;
			int res = seg.query(1, s2.tt, s2.dfn[p], s2.dfn[p] + s2.siz[p] - 1, s1.rt[p1[i]]);
			ans += res;
		//	cerr << res << " ";
			}
		printf("%lld\n", ans);
		for (int i = 1; i <= len; ++i) p1[i] = p2[i] = 0;
	}
	return 0;
}