#include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT);
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define per(i, j, k) for(int i = j; i >= k; -- i)
using namespace std;

#define pb push_back
typedef long long ll;

const int N = 5e5 + 5, M = N * 20;

int n, id, rk[N], sa[N], cnt[N], t[N], h[N];
char s[N];

int rt[N], sz[M], ls[M], rs[M];
void insert(int p, int &u, int l, int r, int x) {
  u = ++ id;
  sz[u] = sz[p] + 1;
  if(l == r) return ;
  int mid = (l + r) >> 1;
  if(x <= mid) rs[u] = rs[p], insert(ls[p], ls[u], l, mid, x);
  else ls[u] = ls[p], insert(rs[p], rs[u], mid + 1, r, x);
}
int kth(int tu, int tv, int l, int r, int k) {
  if(l == r) return l;
  int mid = (l + r) >> 1;
  if(k <= sz[ls[tu]] - sz[ls[tv]])
    return kth(ls[tu], ls[tv], l, mid, k);
  return kth(rs[tu], rs[tv], mid + 1, r, k - (sz[ls[tu]] - sz[ls[tv]]));
}
struct node { int l, r; };
vector<ll> sum[N];
vector<int> ri[N];
vector<node> rg[N];
ll pre[N];
ll Sum(ll l, ll r) {
  return (r + l) * (r - l + 1) / 2;
}
void build() {
  int m = *max_element(s + 1, s + n + 1);
  rep(i, 1, n) cnt[rk[i] = s[i]] ++;
  rep(i, 1, m) cnt[i] += cnt[i - 1];
  rep(i, 1, n) sa[cnt[rk[i]] --] = i;
  for(int k = 1, z = 0; k < n; k <<= 1, m = z, z = 0) {
    rep(i, n - k + 1, n) t[++ z] = i;
    rep(i, 1, n) if(sa[i] > k) t[++ z] = sa[i] - k;
    rep(i, 1, m) cnt[i] = 0;
    rep(i, 1, n) cnt[rk[i]] ++;
    rep(i, 1, m) cnt[i] += cnt[i - 1];
    per(i, n, 1) sa[cnt[rk[t[i]]] --] = t[i];
    copy(rk + 1, rk + n + 1, t + 1); rk[sa[1]] = z = 1;
    rep(i, 2, n) {
      if(t[sa[i]] == t[sa[i - 1]] && t[sa[i] + k] == t[sa[i - 1] + k]) {
        rk[sa[i]] = z;
      } else {
        rk[sa[i]] = ++ z;
      }
    }
    if(z == n) break ;
  }
  int z = 0;
  rep(i, 1, n) {
    if(rk[i] == 1) {
      h[1] = z = 0; continue ;
    }
    if(z) z --;
    int u = sa[rk[i] - 1];
    while(s[u + z] == s[i + z]) z ++;
    h[rk[i]] = z;
  }

  rep(i, 1, n) insert(rt[i-1], rt[i], 1, n, sa[i]);

  static int st[N];
  int top = 0;
  h[n + 1] = 0;
  st[top = 1] = n + 1;
  per(i, n, 1) {
    int z = lower_bound(st + 1, st + top + 1, h[i] + 1, [&](int x, int val) {
      return h[x] < val;
    }) - st;
    int len = n - sa[i] + 1;
    rep(j, z, top + 1) {
      //consider prefix k in [ h[st[j-1]] + 1 , h[st[j]] ]
      int l = max(h[st[j-1]] + 1, h[i] + 1);
      int r = j > top ? len : min(h[st[j]], len);
      if(l > r)
        break;
      ri[i].pb(st[j-1] - i);
      rg[i].pb({l, r});
      ll t = (st[j-1] - i) * Sum(l, r);
      sum[i].pb(sum[i].size() ? t + * --sum[i].end() : t);
      pre[i] += t;
    }
    while(top && h[st[top]] >= h[i])
      -- top;
    st[++ top] = i;
  }
  rep(i, 1, n) pre[i] += pre[i-1];
}
ll solve(ll k) {
  int z = lower_bound(pre + 1, pre + n + 1, k) - pre;
  k -= pre[z-1];
  int c = lower_bound(sum[z].begin(), sum[z].end(), k) - sum[z].begin();
  k -= (c ? sum[z][c-1] : 0);
  int len = ri[z][c];
  const int l0 = rg[z][c].l;
  int l = rg[z][c].l, r = rg[z][c].r;
  while(l <= r) {
    int mid = (l + r) >> 1;
    if(len * Sum(l0, mid) >= k)
      r = mid - 1;
    else 
      l = mid + 1;
  }
  int j = r + 1;
  k -= len * Sum(l0, j-1);
  return kth(rt[z+len-1], rt[z-1], 1, n, (k + j-1)/j) + (k-1)%j;
}

int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  build();
  int q; scanf("%d", &q);
  rep(T, 1, q) {
    ll k; scanf("%lld", &k);
    printf("%lld\n", solve(k));
  }
  return 0;
}