#include<bits/stdc++.h>
using namespace::std;

const int N = 200000 + 5;
const int SUML = 2 * N;
const int E = 26;

struct node{
	int len;
	int link;
	int next[E];
	node(){
		memset(next, 0, sizeof next);
	}
};

int q;
int last;
int nodes;
char s[SUML];
node sa[SUML];

void sa_init(){
	sa[nodes].len = 0;
	sa[nodes].link = -1;
	last = nodes++;
}

int clone_node(int p, int q){
	int clone = nodes++;
	sa[clone].len = sa[p].len + 1;
	sa[clone].link = sa[q].link;
	for(int i = 0; i < E; i++) sa[clone].next[i] = sa[q].next[i];
	return clone;
}

void sa_extend(int c){
	int cur = nodes++;
	sa[cur].len = sa[last].len + 1;
	int p = last;
	while(p != -1 and sa[p].next[c] == 0){
		sa[p].next[c] = cur;
		p = sa[p].link;
	}
	if(p == -1){
		sa[cur].link = 0;
	}
	else{
		int q = sa[p].next[c];
		if(sa[p].len + 1 == sa[q].len){
			sa[cur].link = q;
		}
		else{
			int clone = clone_node(p, q);
			while(p != -1 and sa[p].next[c] == q){
				sa[p].next[c] = clone;
				p = sa[p].link;
			}
			sa[q].link = sa[cur].link = clone;
		}
	}
	last = cur;
}

void build_automaton(){
	sa_init();
	for(int i = 0; s[i]; i++){
		int x = s[i] - 'A';
		sa_extend(x);
	}
}

int solve(){
	int pos = 0;
	int ans = 0;
	for(int i = 0; s[i]; i++){
		int c = s[i] - 'A';
		if(sa[pos].next[c]){
			pos = sa[pos].next[c];
			continue;
		}
		if(sa[pos].next[c] == 0){
			pos = 0;
			ans++;
		}
		if(sa[pos].next[c] == 0) return -1;
		pos = sa[pos].next[c];
	}
	ans += pos > 0;
	return ans;
}

int main(){
	scanf("%s", s);
	build_automaton();
	scanf("%d", &q);
	while(q--){
		scanf("%s", s);
		printf("%d\n", solve());
	}
	return 0;
}