//Code by Patcas Csaba aka SleepyOverlord
#include <vector>
#include <array>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define PLL pair <LL, LL>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVLL vector < VLL >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define MX(x, y) x = max(x, y)
#define MN(x, y) x = min(x, y)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define ALL1(x) x.begin() + 1, x.end()
#define INS insert
#define ER erase
#define CNT count

template <class T> ostream& operator <<(ostream & os, const vector<T> &vec)
{
	for (int i = 0; i < vec.size() - 1; ++i) os << vec[i] << ' ';
	return os << vec[vec.size() - 1];
}

template <class T1, class T2> ostream& operator <<(ostream & os, const pair<T1, T2> &p)
{
	return os << p.X << " " << p.Y;
}

template <typename T>
void pr(T var1)
{
	cout << var1 << '\n';
}
template <typename T, typename... Types>
void pr(T var1, Types... var2)
{
	cout << var1;
	pr(var2...);
}

struct Node
{
	int parent, suffix, cnt;
	char c;
	vector <int> children, output;
};

int n;
string text;
vector <Node> trie;
VI fifo;

void bfs()
{
	fifo.RS(trie.SZ - 1);
	int left = 0, right = 0;
	fifo[0] = 1;
	while (left <= right)
	{
		int node = fifo[left++];
		char c = trie[node].c;
		int parent = trie[node].parent;
		while (node > 1)
		{
			parent = trie[parent].suffix;
			int child = trie[parent].children[c - 'a'];
			if (child)
			{
				trie[node].suffix = child;
				break;
			}
		}
		FORN(i, 26)
		{
			int child = trie[node].children[i];
			if (child) fifo[++right] = child;
		}
	}
}

void add(string word, int ind)
{
	int node = 1;
	for (char ch : word)
	{
		int &child = trie[node].children[ch - 'a'];
		if (child == 0)
		{
			child = trie.SZ;
			trie.PB({node, 0, 0, ch, VI(26), {}});
		}
		node = child;
	}
	trie[node].output.PB(ind);
}

int main()
{
	#ifdef AT_HOME
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#else
	freopen("ahocorasick.in", "r", stdin);
	freopen("ahocorasick.out", "w", stdout);
	#endif

	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

	cin >> text;
	n = text.SZ;
	trie.PB({-1, 0, 0, ' ', VI(26, 1), {}});
	trie.PB({0, 0, 0, ' ', VI(26), {}});
	int k;
	cin >> k;
	FORN(i, k)
	{
		string word;
		cin >> word;
		add(word, i);
	}
	bfs();
	int node = 1;
	for (char ch : text)
	{
		while (trie[node].children[ch - 'a'] == 0) node = trie[node].suffix;
		node = trie[node].children[ch - 'a'];
		++trie[node].cnt;
	}
	VI sol(k);
	FORD(i, fifo.SZ - 1, 0)
	{
		int node = fifo[i], suffix = trie[node].suffix;
		trie[suffix].cnt += trie[node].cnt;
		for (int w : trie[node].output) sol[w] = trie[node].cnt;
	}
	for (int x : sol) pr(x);

	return 0;
}