// Problem: CF1037H Security
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/CF1037H
// Memory Limit: 500 MB
// Time Limit: 4000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define N 500000
string s;
struct tree {
  struct node {
    int l, r;
    node *ls, *rs;
    node(int _l, int _r) : l(_l), r(_r), ls(nullptr), rs(nullptr) {}
  };
  node *root;
  void build(node *x, int pos) {
    if (x->l == x->r) return;
    int mid = (x->l + x->r) / 2;
    if (pos <= mid) {
      x->ls = new node(x->l, mid);
      build(x->ls, pos);
    } else {
      x->rs = new node(mid + 1, x->r);
      build(x->rs, pos);
    }
  }
  void print(node *x) {
    if (!x) return;
    print(x->ls);
    if (x->l == x->r) cout << x->l << " ";
    print(x->rs);
  }
  int query(node *x, int l, int r) {
    if (!x) return 0;
    if (x->l == l && x->r == r) return 1;
    int mid = (x->l + x->r) / 2;
    if (r <= mid)
      return query(x->ls, l, r);
    else if (l > mid)
      return query(x->rs, l, r);
    else
      return max(query(x->ls, l, mid), query(x->rs, mid + 1, r));
  }
  tree(int x) : root(new node(1, s.length() - 1)) { build(root, x); }
  tree() : root(nullptr) {}
};
tree::node *merge(tree::node *x, tree::node *y) {
  if (!x) return y;
  if (!y) return x;
  auto *cur = new tree::node(x->l, x->r);
  cur->ls = merge(x->ls, y->ls);
  cur->rs = merge(x->rs, y->rs);
  return cur;
}
struct SAM {
  int ch[N][26], fail[26], len[N], last = 1, tot = 1, pos = 0;
  vector<int> v[N];
  tree *ra[N];
  void insert() {
    pos++;
    int c = s[pos] - 'a';
    int np = ++tot, p = last;
    len[np] = len[p] + 1;
    ra[np] = new tree(pos);
    last = np;
    while (p && !ch[p][c]) ch[p][c] = np, p = fail[p];
    if (!p) {
      fail[np] = 1;
      return;
    }
    int q = ch[p][c];
    if (len[p] + 1 == len[q]) {
      fail[np] = q;
      return;
    }
    int nq = ++tot;
    len[nq] = len[p] + 1;
    ra[nq] = new tree();
    memcpy(ch[nq], ch[q], sizeof(ch[q]));
    fail[nq] = fail[q];
    fail[np] = fail[q] = nq;
    while (p && ch[p][c] == q) ch[p][c] = nq, p = fail[p];
  }
  void dfs(int x) {
    for (auto to : v[x]) {
      dfs(to);
      ra[x]->root = merge(ra[x]->root, ra[to]->root);
    }
  }
  void build() {
    ra[1] = new tree();
    for (int i = 1; i < s.length(); i++) insert();
    for (int i = 1; i <= tot; i++)
      if (fail[i]) v[fail[i]].push_back(i);
    dfs(1);
  }
  bool query(string str, int l, int r) {
    l = l + str.length() - 1;
    if (l > r) return false;
    int x = 1;
    for (auto c : str) {
      x = ch[x][c - 'a'];
    }
    if (!x) return false;
    if (!ra[x]->query(ra[x]->root, l, r)) return false;
    return true;
  }
};
int main() {
  auto sam = new SAM();
  cin >> s;
  s = "$" + s;
  sam->build();
  int q;
  cin >> q;
  while (q--) {
    string c;
    int l, r;
    cin >> l >> r >> c;
    string ans = "~";
    for (int i = 0; i <= c.length(); i++) {
      for (char j = i < c.length() ? c[i] + 1 : 'a'; j <= 'z'; j++) {
        string tmp = c.substr(0, i) + j;
        if (sam->query(tmp, l, r)) {
          ans = min(ans, tmp);
        }
      }
    }
    if (ans == "~")
      cout << -1 << endl;
    else
      cout << ans << endl;
  }
  return 0;
}