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

using ll=long long;

constexpr int N=2e5+5;
constexpr int M=26;

int n,q;
string s;
vector<int> e[N],vec;
int tree_pos[N],k[N],len[N];
int dfn[N],dfn0,fi[N],lst[N];
int ans[N];
struct Trie{// AC机 P3808 P3796 P3121 P5357
    int tot;
    int nex[N][M];
    int fail[N];
    int cnt[N];
    void insert(string s,int ind){
        int len=s.size();
        int u=0;
        for(int i=0;i<len;i++){
            int w=s[i]-'a';
            if(!nex[u][w]) nex[u][w]=++tot;
            u=nex[u][w];
        }
        cnt[u]++;
        tree_pos[ind]=u;
    }
    void buildfail(){
        queue<int> q;
        for(int i=0;i<M;i++) if(nex[0][i]) q.push(nex[0][i]);
        while(!q.empty()){
            int u=q.front();
            q.pop();
            for(int i=0;i<M;i++){
                if(nex[u][i]){
                    int v=nex[u][i];
                    fail[v]=nex[fail[u]][i];
                    q.push(nex[u][i]);
                }
                else nex[u][i]=nex[fail[u]][i];
            }
        }
        for(int i=1;i<=tot;i++) e[fail[i]].push_back(i);
    }
}tr;
struct BIT{//树状数组
    int bit[N];
    void add(int x,int k){
        for(int i=x;i<=dfn0;i+=(i&-i)) bit[i]+=k;
    }
    int sum(int x){
        int res=0;
        for(int i=x;i;i-=(i&-i)) res+=bit[i];
        return res;
    }
}bit;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>s;
    n=s.size();
    cin>>q;
    for(int i=1;i<=q;i++){
        string t;
        cin>>t>>k[i];
        len[i]=t.size();
        tr.insert(t,i);
    }
    tr.buildfail();
    int now=0;
    vec.push_back(now);
    for(auto c:s){
        now=tr.nex[now][c-'a'];
        vec.push_back(now);
    }

    function<void(int)> dfs=[&](int x){
        dfn[x]=++dfn0;
        fi[x]=dfn0;
        for(auto v:e[x]) dfs(v);
        lst[x]=dfn0;
    };

    dfs(0);//预处理自动机fail树

    function<void(vector<int>&,int,int)> solve=[&](vector<int> &qry,int l,int r){//整体二分 P3332 P1527 P3527 P3157
        if(qry.size()==0) return;
        if(l==r){
            bit.add(dfn[vec[l]],1);
            for(auto x:qry){
                int sum=bit.sum(lst[tree_pos[x]])-bit.sum(fi[tree_pos[x]]-1);
                if(k[x]==sum) ans[x]=l;
                else ans[x]=-1;
            }
            bit.add(dfn[vec[l]],-1);
            return;
        }
        int mid=l+r>>1;
        vector<int> qry1,qry2;
        for(int i=l;i<=mid;i++) bit.add(dfn[vec[i]],1);
        for(auto x:qry){
            int sum=bit.sum(lst[tree_pos[x]])-bit.sum(fi[tree_pos[x]]-1);
            if(k[x]<=sum) qry1.push_back(x);
            else{
                k[x]-=sum;
                qry2.push_back(x);
            }
        }
        for(int i=l;i<=mid;i++) bit.add(dfn[vec[i]],-1);
        solve(qry1,l,mid);
        solve(qry2,mid+1,r);
    };

    vector<int> qry;
    for(int i=1;i<=q;i++) qry.push_back(i);
    solve(qry,1,n);

    for(int i=1;i<=q;i++){
        if(ans[i]==-1) cout<<ans[i]<<"\n";
        else cout<<ans[i]-len[i]+1<<"\n";
    }

    return true&&false;
}