#include<bits/stdc++.h>
using namespace std;
namespace IO {
	constexpr int bufsize = 230005;
	char buf[bufsize], *f1, *f2;
	char gtchar() {return f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++;}
	template<typename T> void read(T &ret)
	{
		int f = ret = 0;
		char ch = gtchar();
		while(!isdigit(ch)) f = ch == '-', ch = gtchar();
		while(isdigit(ch)) ret = (ret << 3) + (ret << 1) + (ch ^ 48), ch = gtchar();
		if(f) ret = -ret;
	}
	template<typename T, typename ...t> void read(T &a, t &...b) {read(a), read(b...);}
}using IO::read;
typedef long long ll;
typedef unsigned long long ull;
constexpr int maxn = 200005;
int n, cnt, val[maxn], ch[maxn][26], fail[maxn];
int dfn[maxn], sz[maxn], rt[maxn], pos[maxn];
vector<int> g[maxn];
string s, str[maxn];
int insert(const string &s)
{
	int now = 0;
	for(char c : s)
	{
		int &p = ch[now][c - 'a'];
		if(!p) p = ++cnt;
		now = p;
	}
	return now;
}
void dfs(int k)
{
	dfn[k] = ++cnt, sz[k] = 1;
	for(int i : g[k]) dfs(i), sz[k] += sz[i];
}
void init()
{
	queue<int> q;
	for(int i = 0; i < 26; ++i) if(ch[0][i]) q.push(ch[0][i]);
	while(q.size())
	{
		int t = q.front();
		q.pop();
		for(int i = 0; i < 26; ++i)
			if(ch[t][i]) fail[ch[t][i]] = ch[fail[t]][i], q.push(ch[t][i]);
			else ch[t][i] = ch[fail[t]][i];
	}
	for(int i = 1; i <= cnt; ++i) g[fail[i]].push_back(i);
	dfs(0);
}
struct segment_tree {
	struct node {
		int l, r, sum;
	}s[maxn * 20];
	int cnt;
	void modify(int k, int &nk, int sl, int sr, int q, int delta)
	{
		if(nk == k) s[nk = ++cnt] = s[k];
		s[nk].sum += delta;
		if(sl == sr) return;
		int mid = sl + sr >> 1;
		q <= mid? modify(s[k].l, s[nk].l, sl, mid, q, delta): modify(s[k].r, s[nk].r, mid + 1, sr, q, delta);
	}
	int query(int k, int sl, int sr, int ql, int qr)
	{
		if(!k || ql <= sl && sr <= qr) return s[k].sum;
		int mid = sl + sr >> 1, ret = 0;
		if(ql <= mid) ret = query(s[k].l, sl, mid, ql, qr);
		if(qr > mid) ret += query(s[k].r, mid + 1, sr, ql, qr);
		return ret;
	}
}tree;
bool check(int ver, int pos, int val) {return tree.query(rt[ver], 1, cnt, dfn[pos], dfn[pos] + sz[pos] - 1) >= val;}
int main()
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> s >> n;
	for(int i = 1; i <= n; ++i) cin >> str[i] >> val[i], pos[i] = insert(str[i]);
	init();
	for(int i = 0, now = 0; i < s.size(); ++i)
	{
		now = ch[now][s[i] - 'a'];
		rt[i + 1] = rt[i];
		tree.modify(rt[i], rt[i + 1], 1, cnt, dfn[now], 1);
	}
	for(int i = 1; i <= n; ++i)
	{
		int l = 1, r = s.size() + 1, pos = ::pos[i];
		while(l < r)
		{
			int mid = l + r >> 1;
			if(check(mid, pos, val[i])) r = mid;
			else l = mid + 1;
		}
		if(l > s.size()) puts("-1");
		else printf("%d\n", l - str[i].size() + 1);
	}
	return 0;
}