CF1187B.Letters Shop

The letters shop showcase is a string $s$, consisting of $n$ lowercase Latin letters. As the name tells, letters are sold in the shop.

Letters are sold one by one from the leftmost to the rightmost. Any customer can only buy some prefix of letters from the string $s$.

There are $m$ friends, the $i$-th of them is named $t_i$. Each of them is planning to estimate the following value: how many letters (the length of the shortest prefix) would s/he need to buy if s/he wanted to construct her/his name of bought letters. The name can be constructed if each letter is presented in the equal or greater amount.

• For example, for $s$="arrayhead" and $t_i$="arya" $5$ letters have to be bought ("arrayhead").
• For example, for $s$="arrayhead" and $t_i$="harry" $6$ letters have to be bought ("arrayhead").
• For example, for $s$="arrayhead" and $t_i$="ray" $5$ letters have to be bought ("arrayhead").
• For example, for $s$="arrayhead" and $t_i$="r" $2$ letters have to be bought ("arrayhead").
• For example, for $s$="arrayhead" and $t_i$="areahydra" all $9$ letters have to be bought ("arrayhead").

It is guaranteed that every friend can construct her/his name using the letters from the string $s$.

Note that the values for friends are independent, friends are only estimating them but not actually buying the letters.

字母商店的展示字符串为 $s$，由 $n$ 个小写拉丁字母组成。顾名思义，商店出售字母。

字母按从左到右的顺序逐个出售。任意顾客只能购买字符串 $s$ 的某个前缀。

共有 $m$ 位朋友，其中第 $i$ 位朋友的名字为 $t_i$。每位朋友都计划估算如下数值：若想用所购字母拼出自己的名字，最少需要购买多少个字母（即最短前缀的长度）？当且仅当所购字母中每种字母的数量均不少于名字中对应字母所需数量时，该名字才可被拼出。

• 例如，当 $s$ = "arrayhead" 且 $t_i$ = "arya" 时，需购买 $5$ 个字母（"arrayhead"）。
• 例如，当 $s$ = "arrayhead" 且 $t_i$ = "harry" 时，需购买 $6$ 个字母（"arrayhead"）。
• 例如，当 $s$ = "arrayhead" 且 $t_i$ = "ray" 时，需购买 $5$ 个字母（"arrayhead"）。
• 例如，当 $s$ = "arrayhead" 且 $t_i$ = "r" 时，需购买 $2$ 个字母（"arrayhead"）。
• 例如，当 $s$ = "arrayhead" 且 $t_i$ = "areahydra" 时，需购买全部 $9$ 个字母（"arrayhead"）。

题目保证每位朋友均能使用字符串 $s$ 中的字母拼出自己的名字。

注意：各位朋友所估算的数值相互独立；他们仅进行估算，并不会实际购买字母。

The first line contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of showcase string $s$.

The second line contains string $s$, consisting of exactly $n$ lowercase Latin letters.

The third line contains one integer $m$ ($1 \le m \le 5 \cdot 10^4$) — the number of friends.

The $i$-th of the next $m$ lines contains $t_i$ ($1 \le |t_i| \le 2 \cdot 10^5$) — the name of the $i$-th friend.

It is guaranteed that $\sum \limits_{i=1}^m |t_i| \le 2 \cdot 10^5$.

第一行包含一个整数 $n$（$1 \le n \le 2 \cdot 10^5$）—— 展示字符串 $s$ 的长度。

第二行包含字符串 $s$，由恰好 $n$ 个小写拉丁字母组成。

第三行包含一个整数 $m$（$1 \le m \le 5 \cdot 10^4$）—— 朋友的数量。

接下来的 $m$ 行中，第 $i$ 行包含 $t_i$（$1 \le |t_i| \le 2 \cdot 10^5$）—— 第 $i$ 个朋友的名字。

保证 $\sum \limits_{i=1}^m |t_i| \le 2 \cdot 10^5$。

For each friend print the length of the shortest prefix of letters from $s$ s/he would need to buy to be able to construct her/his name of them. The name can be constructed if each letter is presented in the equal or greater amount.

It is guaranteed that every friend can construct her/his name using the letters from the string $s$.

对于每位朋友，输出其姓名可被构造出来所需的字符串 $s$ 的最短前缀长度。当且仅当前缀中每种字母的出现次数均不少于该朋友姓名中对应字母的出现次数时，该姓名才可被构造出来。

题目保证：每位朋友均可利用字符串 $s$ 中的字母构造出自己的姓名。