#include<bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;
const int maxn = 4e5 + 5;
int n;
string s;

#define ia array<int, 2>
const ia mod = {2409235909, (int)1e9 + 9}, base = {631, 311};
ia mu[maxn];
int lcp[maxn];

ia operator - (ia a, ia b)
{
    ia c;
    for (int i = 0; i < 2; i++)
        c[i] = (a[i] - b[i] + mod[i]) % mod[i];
    return c;
}

ia operator + (ia a, ia b)
{
    ia c;
    for (int i = 0; i < 2; i++)
    {
        c[i] = (a[i] + b[i]);
        if (c[i] >= mod[i])
            c[i] -= mod[i];
    }
    return c;
}

ia operator * (ia a, ia b)
{
    ia c;
    for (int i = 0; i < 2; i++)
        c[i] = (a[i] * b[i]) % mod[i];
    return c;
}

inline ia makepair(char c)
{
    ia tmp = {c - 'a' + 1, c - 'a' + 1};
    return tmp;
}

ia h[maxn];

void build(string &s)
{
    mu[0] = {1, 1};
    for (int i = 1; i < maxn; i++)
        mu[i] = mu[i - 1] * base;
    h[0] = {0, 0};
    for (int i = 0; i < s.size(); i++)
        h[i + 1] = h[i] * base + makepair(s[i]);
}

inline bool check(int u, int v, int x, int y)
{
    return (h[v] - (h[u - 1] * mu[v - u + 1])) == (h[y] - (h[x - 1] * mu[y - x + 1]));
}

void _sort(vector<pair<ii,int>> &a)
{
    vector<pair<ii,int>> a_new(n);
    {
        vector<int> cnt(n, 0), pos(n, 0);
        for (auto i : a)
            cnt[i.ff.ss]++;
        for (int i = 1; i < n; i++)
            pos[i] = pos[i - 1] + cnt[i - 1];
        for (auto i : a)
            a_new[pos[i.ff.ss]] = i,
            pos[i.ff.ss]++;
        a.swap(a_new);
    }
    {
        vector<int> cnt(n, 0), pos(n, 0);
        for (auto i : a)
            cnt[i.ff.ff]++;
        for (int i = 1; i < n; i++)
            pos[i] = pos[i - 1] + cnt[i - 1];
        for (auto i : a)
            a_new[pos[i.ff.ff]] = i,
            pos[i.ff.ff]++;
        a.swap(a_new);
    }
}

int get_same(int pos1, int pos2)
{
    int l = 1, r = min(n - pos1 - 1, n - pos2 - 1), ans = 0;
    while (l <= r)
    {
        int mid = (l + r) / 2;
        if (check(pos1 + 1, pos1 + mid, pos2 + 1, pos2 + mid) && s[pos1 + mid - 1] != '$')
            ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    return ans;
}

vector<int> suffix_array(string s)
{
    int n = s.size();
    vector<int> p(n), r(n);
    vector<ii> a(n);
    for (int i = 0; i < n; i++)
            a[i] = {(int)s[i], i};
    sort(a.begin(), a.end());
    for (int i = 0; i < n; i++)
    {
        p[i] = a[i].ss;
        r[p[i]] = 0;
        if (i > 0)
            r[p[i]] = r[p[i - 1]] + (a[i].ff != a[i - 1].ff);
    }
    for (int k = 0; (1 << k) < n; k++)
    {
        vector<pair<ii,int>> a(n);
        for (int i = 0; i < n; i++)
            a[i] = {{r[i], r[(i + (1 << k)) % n]}, i};
        _sort(a);
        for (int i = 0; i < n; i++)
        {
            p[i] = a[i].ss;
            r[p[i]] = 0;
            if (i > 0)
                r[p[i]] = r[p[i - 1]] + (a[i].ff != a[i - 1].ff);
        }
    }
    return p;
}

struct node{
    node *l, *r;
    int sum;
    node(int val = 0)
    {
        sum = val;
        l = r = 0;
    }
    node (node *lx, node *rx)
    {
        l = lx;
        r = rx;
        sum = (l ? l -> sum : 0) + (r ? r -> sum : 0);
    }
};

node *v[maxn];
int lim;

inline void build(node *id, int l = 0, int r = lim)
{
    if (l == r)
    {
        id -> sum = 0;
        return;
    }
    int mid = (l + r) / 2;
    build(id -> l = new node(), l, mid);
    build(id -> r = new node(), mid + 1, r);
    id -> sum = id -> l -> sum + id -> r -> sum;
}

inline node* upd(int pos, int val, node *id, int l = 0, int r = lim)
{
    if (l == r) return new node(val);
    int mid = (l + r) / 2;
    if (pos <= mid) return new node(upd(pos, val, id -> l, l, mid), id -> r);
    return new node(id -> l, upd(pos, val, id -> r, mid + 1, r));
}

int qry(node *x, node *y, int k, int l = 0, int r = lim)
{
    if (l == r) return l;
    int mid = (l + r) / 2;
    int le = y -> l -> sum - x -> l -> sum;
    if (le >= k) return qry(x -> l, y -> l, k, l, mid);
    return qry(x -> r, y -> r, k - le, mid + 1, r);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//    freopen("test.inp", "r", stdin);
//    freopen("test.out", "w", stdout);
    cin >> s;
    s += '#';
    n = s.size();
    build(s);
    vector<int> p = suffix_array(s);
    lim = n;
    v[0] = new node();
    build(v[0]);
    for (int i = 1; i < n; i++)
        v[i] = v[i - 1],
        v[i] = upd(p[i], 1, v[i]);
    int q; cin >> q;
    while (q--)
    {
        string qr;
        int k;
        cin >> qr >> k;
        int no = 0, rl = 1, rr = n - 1;
        for (int i = 0; i < qr.size(); i++)
        {
            int l = rl, r = rr, ansl = n + 1, ansr = 0;
            while (l <= r)
            {
                int mid = (l + r) / 2;
                if (p[mid] + i < n && s[p[mid] + i] >= qr[i])
                    ansl = mid, r = mid - 1;
                else l = mid + 1;
            }
            l = rl, r = rr;
            while (l <= r)
            {
                int mid = (l + r) / 2;
                if (p[mid] + i < n && s[p[mid] + i] <= qr[i])
                    ansr = mid, l = mid + 1;
                else r = mid - 1;
            }
            rl = ansl;
            rr = ansr;
        }
        if (rr - rl + 1 < k) cout << -1 << "\n";
        else cout << qry(v[rl - 1], v[rr], k) + 1 << "\n";
    }
}