#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
#define pb push_back
#define ll long long
#define s second
#define f first
#define MOD 1000000007
#define INF 1000000000
using i64 = long long;

struct SuffixArray
{
  int n;
  std::vector<int> sa, rk, lc;
  SuffixArray(const std::string &s)
  {
    n = s.length();
    sa.resize(n);
    lc.resize(n - 1);
    rk.resize(n);
    std::iota(sa.begin(), sa.end(), 0);
    std::sort(sa.begin(), sa.end(), [&](int a, int b)
              { return s[a] < s[b]; });
    rk[sa[0]] = 0;
    for (int i = 1; i < n; ++i)
      rk[sa[i]] = rk[sa[i - 1]] + (s[sa[i]] != s[sa[i - 1]]);
    int k = 1;
    std::vector<int> tmp, cnt(n);
    tmp.reserve(n);
    while (rk[sa[n - 1]] < n - 1)
    {
      tmp.clear();
      for (int i = 0; i < k; ++i)
        tmp.push_back(n - k + i);
      for (auto i : sa)
        if (i >= k)
          tmp.push_back(i - k);
      std::fill(cnt.begin(), cnt.end(), 0);
      for (int i = 0; i < n; ++i)
        ++cnt[rk[i]];
      for (int i = 1; i < n; ++i)
        cnt[i] += cnt[i - 1];
      for (int i = n - 1; i >= 0; --i)
        sa[--cnt[rk[tmp[i]]]] = tmp[i];
      std::swap(rk, tmp);
      rk[sa[0]] = 0;
      for (int i = 1; i < n; ++i)
        rk[sa[i]] = rk[sa[i - 1]] + (tmp[sa[i - 1]] < tmp[sa[i]] || sa[i - 1] + k == n || tmp[sa[i - 1] + k] < tmp[sa[i] + k]);
      k *= 2;
    }
    for (int i = 0, j = 0; i < n; ++i)
    {
      if (rk[i] == 0)
      {
        j = 0;
      }
      else
      {
        for (j -= j > 0; i + j < n && sa[rk[i] - 1] + j < n && s[i + j] == s[sa[rk[i] - 1] + j];)
          ++j;
        lc[rk[i] - 1] = j;
      }
    }
  }
};

void solve(){
  string str;cin>>str;
  SuffixArray sa(str);
  set<char> alf;
  for(auto u:str){
    alf.insert(u);
  }
  int n;cin>>n;
  for(int i=0;i<n;i++){
    string si;cin>>si;
    bool x=0;
    for(auto u:si){
      if(alf.count(u)==0){
        cout<<-1<<endl;
        x=1;
        break;
      }
    }
    if(x)continue;
    int ans=0;
    bool d1=1;
    int poi=0;
    while(si.size()>poi){
      int l=-1,r=str.size()-1;
      while(r-l>1){
        int m1=l+(r-l)/2;
        bool d=str.size()-sa.sa[m1]>=(si.size()-poi);
        
        for(int j=sa.sa[m1];j<str.size()&&j-sa.sa[m1]<(si.size()-poi);j++){
          if(str[j]!=si[poi+j-sa.sa[m1]]){
            d=str[j]>si[poi+j-sa.sa[m1]];
            break;
          }
        }
        if(d){
          r=m1;
        }
        else{
          l=m1;
        }
      }
      int f=0;
      for(int j=max(0,r-1);j<=min(r,int(str.size()-1));j++){
        int actual=0;
        for(int k=sa.sa[j];k<str.size()&&k-sa.sa[j]<(si.size()-poi);k++){
          if(str[k]==si[poi+k-sa.sa[j]]){
            actual++;
          }
          else{
            break;
          }
        }
        f=max(f,actual);
      }
      if(f==0){
        d1=0;
        break;
      }
      poi+=f;
      ans++;
    }
    
    if(d1){
      cout<<ans<<endl;
    }
    else{
      cout<<-1<<endl;
    }
  }
  // cout<<3232<<endl;
  // for(int i=0;i<str.size();i++){
  //   cout<<sa.sa[i]<<endl;
  // }
}

int main() {
  ios_base::sync_with_stdio(false);  cin.tie(0);  cout.tie(0);
  //int t;cin>>t;for(int T=0;T<t;T++)
  solve();
}