/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


struct SuffixAutomaton {
    struct State {
        int len, link;
        std::map<char, int> transitions;
    };

    std::vector<State> states;
    int last;

    SuffixAutomaton(const std::string& s) {
        states.reserve(2 * s.size());
        states.push_back({0, -1}); // Initial state
        last = 0;
        for (char c : s)
            add_char(c);
    }

    void add_char(char c) {
        int cur = states.size();
        states.push_back({states[last].len + 1, -1});
        int p = last;
        while (p != -1 && !states[p].transitions.count(c)) {
            states[p].transitions[c] = cur;
            p = states[p].link;
        }
        if (p == -1) {
            states[cur].link = 0;
        } else {
            int q = states[p].transitions[c];
            if (states[p].len + 1 == states[q].len) {
                states[cur].link = q;
            } else {
                int clone = states.size();
                states.push_back(states[q]);
                states[clone].len = states[p].len + 1;
                while (p != -1 && states[p].transitions[c] == q) {
                    states[p].transitions[c] = clone;
                    p = states[p].link;
                }
                states[q].link = states[cur].link = clone;
            }
        }
        last = cur;
    }

    int query(const std::string& t)
    {
        int current_state = 0;
        int ctr=1;
        for (char c : t)
        {
            if (!states[current_state].transitions.count(c))
            {
				++ctr;
				current_state=0;
			}
            current_state = states[current_state].transitions[c];
        }
        return ctr;
    }
};


int solve()
{
	string W;
	if(!(cin>>W))return 1;
	SuffixAutomaton sa(W);
	bool there[26]{};
	for(auto& ch: W)
		there[ch-'A']=true;
	int n;
	cin>>n;
	vector<string> s(n);
	FOR(i,0,n)cin>>s[i];

	for(auto& str: s)
	{
		bool ok=true;
		for(auto ch:str)
		{
			if(!there[ch-'A'])ok=false;
		}
		cout << (ok ? sa.query(str) : -1) << '\n';
	}
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}