Frequency of String

给你一个字符串 $s \pod {|S| \le 10^5}$ ，有 $n \pod {n \le 10^5}$ 个询问，第 $i$ 个询问包含一个整数 $k_i$ 和一个字符串 $m_i \pod {\sum_i |m_i| \le 10^5}$ 。要求找到一个字符串 $t$ ，使得 $t$ 是 $s$ 的子串并且 $m_i$ 至少在 $t$ 中出现了 $k_i$ 次。你只需要求出 $t$ 的最短长度。 保证 $m_i$ 互不相同。 感谢@OrangeLee 提供的翻译

You are given a string $ s $ . You should answer $ n $ queries. The $ i $ -th query consists of integer $ k_i $ and string $ m_i $ . The answer for this query is the minimum length of such a string $ t $ that $ t $ is a substring of $ s $ and $ m_i $ has at least $ k_i $ occurrences as a substring in $ t $ . A substring of a string is a continuous segment of characters of the string. It is guaranteed that for any two queries the strings $ m_i $ from these queries are different.

The first line contains string $ s $ $ (1 \leq \left | s \right | \leq 10^{5}) $ . The second line contains an integer $ n $ ( $ 1 \leq n \leq 10^5 $ ). Each of next $ n $ lines contains an integer $ k_i $ $ (1 \leq k_i \leq |s|) $ and a non-empty string $ m_i $ — parameters of the query with number $ i $ , in this order. All strings in input consists of lowercase English letters. Sum of length of all strings in input doesn't exceed $ 10^5 $ . All $ m_i $ are distinct.

For each query output the answer for it in a separate line. If a string $ m_{i} $ occurs in $ s $ less that $ k_{i} $ times, output -1.

aaaaa
5
3 a
3 aa
2 aaa
3 aaaa
1 aaaaa

3
4
4
-1
5

abbb
7
4 b
1 ab
3 bb
1 abb
2 bbb
1 a
2 abbb

-1
2
-1
3
-1
1
-1