#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

struct SA {
  int n;
  vector<int> sa, rk;
  SA(const string &s) : n(s.size()), sa(n), rk(2 * n, -1) {
    iota(sa.begin(), sa.end(), 0);
    for (int i = 0; i < n; ++i) rk[i] = s[i];
    auto old = rk;
    for (int w = 1; w < n; w *= 2) {
      sort(sa.begin(), sa.end(), [&](auto u, auto v) {
        return rk[u] < rk[v] || rk[u] == rk[v] && rk[u + w] < rk[v + w];
      });
      swap(old, rk);
      rk[sa[0]] = 0;
      for (int i = 1; i < n; ++i) {
        rk[sa[i]] = rk[sa[i - 1]] + (old[sa[i]] != old[sa[i - 1]] || old[sa[i] + w] != old[sa[i - 1] + w]);
      }
      if (rk[sa[n - 1]] == n - 1) break;
    }
    rk.resize(n);
  }
};

constexpr int N = 5e5 + 5;

int n, sz, cnt[N * 30], ls[N * 30], rs[N * 30], rt[N];
int mdf(int x, int i, int l = 0, int r = n - 1) {
  cnt[++sz] = cnt[i], ls[sz] = ls[i], rs[sz] = rs[i];
  cnt[i = sz]++;
  if (l == r) return i;
  int mid = (l + r) / 2;
  if (x <= mid) ls[i] = mdf(x, ls[i], l, mid);
  else rs[i] = mdf(x, rs[i], mid + 1, r);
  return i;
}
int qry(int k, int i, int j, int l = 0, int r = n - 1) {
  if (l == r) return l;
  int mid = (l + r) / 2;
  if (cnt[ls[i]] - cnt[ls[j]] < k) return qry(k - cnt[ls[i]] + cnt[ls[j]], rs[i], rs[j], mid + 1, r);
  else return qry(k, ls[i], ls[j], l, mid);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  string s;
  cin >> s;
  int n = s.size();
  SA _sa(s);
  auto sa = _sa.sa;
  ::n = n;
  for (int i = 0; i < n; ++i) {
    rt[i + 1] = mdf(sa[i], rt[i]);
  }
  vector<i64> pre(n + 1);
  for (int i = 0; i < n; ++i) {
    pre[i + 1] = pre[i] + i64(n - sa[i]) * (n - sa[i] + 1) / 2;
  }
  int q;
  cin >> q;
  vector<i64> a(q);
  for (int i = 0; i < q; ++i) {
    cin >> a[i];
  }
  auto b = a;
  sort(b.begin(), b.end());
  vector<int> o(q), ans(q);
  iota(o.begin(), o.end(), 0);
  sort(o.begin(), o.end(), [&](auto u, auto v) {
    return a[u] < a[v];
  });
  auto solve = [&](auto self, int l, int r, int ql, int qr, i64 res, int w) {
    if (l >= r || ql >= qr) return;
    if (l == r - 1) {
      for (int i = ql; i < qr; ++i) {
        int id = o[i];
        if (res + w + 1 < a[id]) {
          int li = w + 1, ri = n;
          while (li < ri) {
            int mi = (li + ri + 1) / 2;
            if (res + i64(w + 1 + mi) * (mi - (w + 1) + 1) / 2 < a[id]) li = mi;
            else ri = mi - 1;
          }
          res += i64(w + 1 + ri) * (ri - (w + 1) + 1) / 2;
          w = ri;
        }
        ans[id] = sa[l] + a[id] - res - 1;
      }
      return;
    }
    i64 dt = i64(w) * (w + 1) / 2;
    while (l < r && ql < qr) {
      int li = l, ri = r - 1;
      while (li < ri) {
        int mi = (li + ri + 1) / 2;
        if (s[sa[mi] + w] == s[sa[l] + w]) li = mi;
        else ri = mi - 1;
      }
      i64 len = ri - l + 1;
      i64 all = pre[ri + 1] - pre[l] - dt * len;
      i64 lens = len * (w + 1);
      while (ql < qr && res + lens >= a[o[ql]]) {
        ans[o[ql]] = qry((a[o[ql]] - res - 1) / (w + 1) + 1, rt[ri + 1], rt[l])
            + (a[o[ql]] - res - 1) % (w + 1);
        ql++;
      }
      int p = upper_bound(b.begin(), b.end(), res + all) - b.begin();
      self(self, l, ri + 1, ql, p, res + lens, w + 1);
      l = ri + 1;
      ql = p;
      res += all;
    }
  };
  solve(solve, 0, n, 0, q, 0, 0);
  for (int i = 0; i < q; ++i) {
    cout << ans[i] + 1 << "\n";
  }
  return 0;
}