#include <bits/stdc++.h>
using namespace std;
using ll = long long;

pair<vector<int>, vector<int>> SuffixArray(const string &s){ // O(N log N)
  int n = s.size(), m = max(n, 256);
  vector<int> sa(n), lcp(n), pos(n), tmp(n), cnt(m);
  auto counting_sort = [&](){
    fill(cnt.begin(), cnt.end(), 0);
    for(int i=0; i<n; i++) cnt[pos[i]]++;
    partial_sum(cnt.begin(), cnt.end(), cnt.begin());
    for(int i=n-1; i>=0; i--) sa[--cnt[pos[tmp[i]]]] = tmp[i];
  };
  for(int i=0; i<n; i++) sa[i] = i, pos[i] = s[i], tmp[i] = i;
  counting_sort();
  for(int k=1; ; k<<=1){
    int p = 0;
    for(int i=n-k; i<n; i++) tmp[p++] = i;
    for(int i=0; i<n; i++) if(sa[i] >= k) tmp[p++] = sa[i] - k;
    counting_sort();
    tmp[sa[0]] = 0;
    for(int i=1; i<n; i++){
      tmp[sa[i]] = tmp[sa[i-1]];
      if(sa[i-1]+k < n && sa[i]+k < n && pos[sa[i-1]] == pos[sa[i]] && pos[sa[i-1]+k] == pos[sa[i]+k]) continue;
      tmp[sa[i]] += 1;
    }
    swap(pos, tmp); if(pos[sa.back()] + 1 == n) break;
  }
  for(int i=0, j=0; i<n; i++, j=max(j-1,0)){
    if(pos[i] == 0) continue;
    while(sa[pos[i]-1]+j < n && sa[pos[i]]+j < n && s[sa[pos[i]-1]+j] == s[sa[pos[i]]+j]) j++;
    lcp[pos[i]] = j;
  }
  return {sa, lcp};
}

#define mid ((l+r) >> 1)

struct Node {
    int l, r, s;
} t[9005005];

int r[600600], cnt;

int n, k[200200], ans[200200], in[600600], N, M;
string s[200200];

int build(int l = 0, int r = M){
    int u = ++cnt;
    if(l == r) return u;
    t[u].l = build(l, mid), t[u].r = build(mid+1, r);
    return u;
}

int update(int p, int x, int l = 0, int r = M) {
    if(x < l || r < x) return p;

    int u = ++cnt;
    if(l == r) {
        t[u].s = t[p].s+1;
        return u;
    }

    t[u].l = update(t[p].l, x, l, mid), t[u].r = update(t[p].r, x, mid+1, r);
    t[u].s = t[t[u].l].s + t[t[u].r].s;
    return u;
}

int find_kth(int L, int R, int k, int l = 0, int r = M) {
    if(l == r) return l;

    int x = t[t[R].l].s - t[t[L].l].s;
    if(k <= x) return find_kth(t[L].l, t[R].l, k, l, mid);
    return find_kth(t[L].r, t[R].r, k-x, mid+1, r);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> s[0] >> n;
    for(int i=1;i<=n;i++) cin >> s[i] >> k[i];

    string S;
    for(int i=0;i<=n;i++) in[S.size()] = i, S += s[i] + "#" + (i == 0 ? "{" : "");
    auto [sa, lcp] = SuffixArray(S); lcp.push_back(0);
    N = S.size(), M = s[0].size();

    build();
    for(int i=1;i<N;i++) {
        if(sa[i] < s[0].size()) r[i] = update(r[i-1], sa[i]);
        else r[i] = r[i-1];
    }

    vector<array<int, 2>> st(1, {0, N});
    for(int i=N-1;i>=0;i--) {
        int u = in[sa[i]];
        if(u) {
            auto it = prev(lower_bound(st.begin(), st.end(), array<int, 2>({(int)s[u].size(), 0})));
            ans[u] = find_kth(r[i], r[(*it)[1]-1], k[u]);
        }

        while(!st.empty() && st.back()[0] >= lcp[i]) st.pop_back();
        st.push_back({lcp[i], i});
    }

    for(int i=1;i<=n;i++) cout << (ans[i] == M ? -1 : ans[i]+1) << "\n";
}