String Game

# Problem 给定两个由小写字母构成的字符串p和t，同时给定一个由数字1,2,3...∣P∣组成的排列。（其中∣p∣表示字符串p的长度）按该排列顺序依次删除字符串p相应位置上的字母，删除过程中，约定各个字符的位置不变。请计算最多可以删除几次，字符串p中仍然包含字符串t。（即字符串t仍然是字符串p的子序列） ##### 数据保证有解。 # Input Data 第一行，一个字符串p；1≤∣p∣<∣t∣≤200,0001 第二行，一个字符串t； 第三行，数字1到∣p∣组成的一个排列。 # Output Data 一行，一个整数，表示最多删除的次数。 # Input Sample 1 ababcba abb 5 3 4 1 7 6 2 # Output Sample 1 3

Little Nastya has a hobby, she likes to remove some letters from word, to obtain another word. But it turns out to be pretty hard for her, because she is too young. Therefore, her brother Sergey always helps her. Sergey gives Nastya the word $ t $ and wants to get the word $ p $ out of it. Nastya removes letters in a certain order (one after another, in this order strictly), which is specified by permutation of letters' indices of the word $ t $ : $ a_{1}...\ a_{|t|} $ . We denote the length of word $ x $ as $ |x| $ . Note that after removing one letter, the indices of other letters don't change. For example, if $ t= $ "nastya" and $ a=[4,1,5,3,2,6] $ then removals make the following sequence of words "nastya"  "nastya"  "nastya"  "nastya"  "nastya"  "nastya"  "nastya". Sergey knows this permutation. His goal is to stop his sister at some point and continue removing by himself to get the word $ p $ . Since Nastya likes this activity, Sergey wants to stop her as late as possible. Your task is to determine, how many letters Nastya can remove before she will be stopped by Sergey. It is guaranteed that the word $ p $ can be obtained by removing the letters from word $ t $ .

The first and second lines of the input contain the words $ t $ and $ p $ , respectively. Words are composed of lowercase letters of the Latin alphabet ( $ 1<=|p|&lt;|t|<=200000 $ ). It is guaranteed that the word $ p $ can be obtained by removing the letters from word $ t $ . Next line contains a permutation $ a_{1},a_{2},...,a_{|t|} $ of letter indices that specifies the order in which Nastya removes letters of $ t $ ( $ 1<=a_{i}<=|t| $ , all $ a_{i} $ are distinct).

Print a single integer number, the maximum number of letters that Nastya can remove.

ababcba
abb
5 3 4 1 7 6 2

3

bbbabb
bb
1 6 3 4 2 5

4

In the first sample test sequence of removing made by Nastya looks like this: "ababcba"  "ababcba"  "ababcba"  "ababcba" Nastya can not continue, because it is impossible to get word "abb" from word "ababcba". So, Nastya will remove only three letters.