#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
string s;
const int N=2e5+10;
const int mod=1e9+7,ba=131;
int ha[N],jc[N],n;
int has(int l,int r) {
	return ((ha[r]-ha[l-1]*jc[r-l+1]%mod)%mod+mod)%mod;
}
vector<pair<string,pair<int,int>>>v[N];
vector<int>nw;
int ans[N];
gp_hash_table<int,int>mp,ma;
vector<int>vv[N];
void solve() {
	cin>>s;
	n=s.size();
	s=" "+s;
	jc[0]=1;
	rep(i,1,n) jc[i]=jc[i-1]*ba%mod,ha[i]=(ha[i-1]*ba%mod+s[i]-'a'+1)%mod;
	int m;
	in(m);
	rep(i,1,m){
		string t;
		int k;
		cin>>t>>k;
		int len=t.size();
		if(!v[len].size()) nw.pb(len);
		v[len].pb({t,{k,i}});
	}
	for(auto to:nw) {
		mp.clear();
		int idx=0;
		rep(j,1,n-to+1) {
			int hs=has(j,j+to-1);
			if(!mp[hs]) mp[hs]=++idx;
			vv[mp[hs]].pb(j);
		}
		for(auto to1:v[to]) {
			int hs=false;
			for(auto to2:to1.first) hs=(hs*ba%mod+to2-'a'+1)%mod;
			if(!mp[hs]) ans[to1.second.second]=-1;
			else {
				if(vv[mp[hs]].size()<to1.second.first) ans[to1.second.second]=-1;
				else {
					ans[to1.second.second]=vv[mp[hs]][to1.second.first-1];
				}
			}
		}
		rep(j,1,idx) vv[j].clear();
	}
	rep(i,1,m) printf("%lld\n",ans[i]);
}
fire main() {
	while(T--) {
		solve();
	}
	return false;
}