#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

constexpr int N = 2E5 + 5;

int n, m, rt;
std::string s, ins;
std::vector<int> adj[N], b[N];
int kk[N], ans[N], len[N];

struct Node {
	int son[26];
	int fail;
} tr[N];
int tot;
void insert(int &x, int i, int I) {
	if (!x && i) x = ++tot;
	if (i == ins.size()) {
		b[x].push_back(I);
		return ;
	}
	insert(tr[x].son[ins[i] - 'a'], i + 1, I);
}
void build() {
	std::queue<int> q;
	for (int i = 0; i < 26; ++i) {
		if (tr[rt].son[i]) {
			q.push(tr[rt].son[i]);
		}
	}
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (int i = 0; i < 26; ++i) {
			if (tr[u].son[i]) {
				tr[tr[u].son[i]].fail = tr[tr[u].fail].son[i];
				q.push(tr[u].son[i]);
			} else {
				tr[u].son[i] = tr[tr[u].fail].son[i];
			}
		}
	}
}

struct Data {
	int ls, rs;
	int sz;
} t[N << 5];
int Tot, root[N];
void insert(int &p, int l, int r, int pos) {
	if (!p) p = ++Tot;
	t[p].sz++;
	if (l == r) return ;
	int mid = (l + r) / 2;
	if (pos <= mid) insert(t[p].ls, l, mid, pos);
	else insert(t[p].rs, mid + 1, r, pos);
}
int merge(int x, int y, int l, int r) {
	if (!x || !y) return x | y;
	t[x].sz += t[y].sz;
	if (l == r) return x;
	int mid = (l + r) / 2;
	t[x].ls = merge(t[x].ls, t[y].ls, l, mid);
	t[x].rs = merge(t[x].rs, t[y].rs, mid + 1, r);
	return x;
}
int binary(int x, int l, int r, int k) {
	if (!x || t[x].sz < k) return -1;
	if (l == r) return l;
	int mid = (l + r) / 2;
	if (t[t[x].ls].sz < k) return binary(t[x].rs, mid + 1, r, k - t[t[x].ls].sz);
	return binary(t[x].ls, l, mid, k);
}
int query(int x, int l, int r, int L, int R) {
	if (!x || r < L || l > R) return 0;
	if (l >= L && r <= R) return t[x].sz;
	int mid = (l + r) / 2;
	return query(x * 2, l, mid, L, R) + query(x * 2 + 1, mid + 1, r, L, R);
}

void dfs(int x) {
	for (auto y : adj[x]) {
		dfs(y);
		root[x] = merge(root[x], root[y], 1, n);
	}
	for (auto id : b[x]) {
		int k = kk[id];
		ans[id] = binary(root[x], 1, n, k);
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	std::cin >> s;
	std::cin >> m;
	n = s.size();

	for (int i = 1; i <= m; ++i) {
		std::cin >> ins;
		std::cin >> kk[i];
		len[i] = ins.size();
		insert(rt, 0, i);
	}
	build();

	for (int i = 1; i <= tot; ++i) {
		adj[tr[i].fail].push_back(i);
	}

	int nw = rt;
	for (int i = 0; i < n; ++i) {
		nw = tr[nw].son[s[i] - 'a'];
		insert(root[nw], 1, n, i + 1);
	}

	dfs(rt);

	for (int i = 1; i <= m; ++i) {
		if (~ans[i]) ans[i] -= len[i] - 1;
		std::cout << ans[i] << "\n";
	}

	return 0;
}