CF1037H.Security

Some programming website is establishing a secure communication protocol. For security reasons, they want to choose several more or less random strings.

Initially, they have a string $s$ consisting of lowercase English letters. Now they want to choose $q$ strings using the following steps, and you are to help them.

1. A string $x$ consisting of lowercase English letters and integers $l$ and $r$ ($1 \leq l \leq r \leq |s|$) are chosen.
2. Consider all non-empty distinct substrings of the $s_l s_{l + 1} \ldots s_r$, that is all distinct strings $s_i s_{i+1} \ldots s_{j}$ where $l \le i \le j \le r$. Among all of them choose all strings that are lexicographically greater than $x$.
3. If there are no such strings, you should print $-1$. Otherwise print the lexicographically smallest among them.

String $a$ is lexicographically less than string $b$, if either $a$ is a prefix of $b$ and $a \ne b$, or there exists such a position $i$ ($1 \le i \le min(|a|, |b|)$), such that $a_i \lt b_i$ and for all $j$ ($1 \le j \lt i$) $a_j = b_j$. Here $|a|$ denotes the length of the string $a$.

某个编程网站正在建立一种安全通信协议。出于安全考虑，他们希望选择若干个近乎随机的字符串。

最初，他们有一个由小写英文字母组成的字符串 $s$。现在，他们希望按照以下步骤选择 $q$ 个字符串，而你需要协助完成这一任务。

1. 选定一个由小写英文字母组成的字符串 $x$，以及两个整数 $l$ 和 $r$（满足 $1 \leq l \leq r \leq |s|$）。
2. 考虑子串 $s_l s_{l + 1} \ldots s_r$ 的所有非空且互不相同的子串，即所有形如 $s_i s_{i+1} \ldots s_{j}$ 的不同字符串，其中 $l \le i \le j \le r$。在这些子串中，选出所有字典序严格大于 $x$ 的字符串。
3. 若不存在这样的字符串，则输出 $-1$；否则，输出其中字典序最小的那个字符串。

字符串 $a$ 的字典序小于字符串 $b$，当且仅当满足以下任一条件：

• $a$ 是 $b$ 的真前缀（即 $a$ 是 $b$ 的前缀且 $a \ne b$），或
• 存在某个位置 $i$（满足 $1 \le i \le \min(|a|, |b|)$），使得 $a_i \lt b_i$，且对所有 $j$（满足 $1 \le j \lt i$）均有 $a_j = b_j$。
  此处 $|a|$ 表示字符串 $a$ 的长度。

The first line of input contains a non-empty string $s$ ($1 \leq |s| \leq 10^{5}$) consisting of lowercase English letters.

The second line contains an integer $q$ ($1 \le q \le 2 \cdot 10^5$) — the number of strings to select.

Each of the next $q$ lines contains two integers $l$, $r$ ($1 \leq l \leq r \leq |s|$) and a non-empty string $x$ consisting of lowercase English letters. The total length of strings $x$ for all queries does not exceed $2 \cdot 10^{5}$.

输入的第一行包含一个非空字符串 $s$（$1 \leq |s| \leq 10^{5}$），由小写英文字母组成。

第二行包含一个整数 $q$（$1 \le q \le 2 \cdot 10^5$）—— 表示需要选择的字符串个数。

接下来的 $q$ 行中，每行包含两个整数 $l$、$r$（$1 \leq l \leq r \leq |s|$）以及一个非空字符串 $x$（由小写英文字母组成）。所有查询中字符串 $x$ 的总长度不超过 $2 \cdot 10^{5}$。

Output $q$ lines, each of them should contain the desired string or $-1$, if there is no such string.

输出 $q$ 行，每行应包含所求的字符串；若不存在这样的字符串，则输出 $-1$。

Consider the first example.

The string $s$ is "baa". The queries are as follows.

1. We consider the substring $s_1 s_2$ that is "ba". It has substrings "b", "a" and "ba", since none of them is greater than the query string "ba", the answer is $-1$.
2. We consider substring "aa". Among its substrings only "aa" is greater than the query string "a". So the answer is "aa".
3. We consider substring "ba". Out of "b", "a" and "ba" only "ba" is greater than the query string "b", so the answer is "ba".
4. We consider substring "aa". No substring of "aa" is greater than the query string "aa" so the answer is $-1$.
5. We consider substring "baa" and it has (among others) substrings "ba", "baa" which are greater than the query string "b". Since "ba" is lexicographically smaller than "baa", the answer is "ba".

考虑第一个例子。

字符串 $s$ 为 "baa"。查询如下：

1. 我们考虑子串 $s_1 s_2$，即 "ba"。它的子串有 "b"、"a" 和 "ba"；由于其中没有一个子串大于查询字符串 "ba"，答案为 $-1$。
2. 我们考虑子串 "aa"。在其所有子串中，只有 "aa" 大于查询字符串 "a"，因此答案为 "aa"。
3. 我们考虑子串 "ba"。在子串 "b"、"a" 和 "ba" 中，仅有 "ba" 大于查询字符串 "b"，因此答案为 "ba"。
4. 我们考虑子串 "aa"。"aa" 的任意子串均不大于查询字符串 "aa"，因此答案为 $-1$。
5. 我们考虑子串 "baa"，其子串（包括但不限于）有 "ba" 和 "baa"，二者均大于查询字符串 "b"。由于 "ba" 的字典序小于 "baa"，因此答案为 "ba"。