CodeForces - 779D

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₁... 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.

Input

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| < |t| ≤ 200 000). It is guaranteed that the word p can be obtained by removing the letters from word t.

Next line contains a permutation a₁, a₂, ..., 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).

Output

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

Examples

Input

ababcba
abb
5 3 4 1 7 6 2

Output

3

Input

bbbabb
bb
1 6 3 4 2 5

Output

4

Note

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.

题意：当初看这个题看了快一小时了还是不理解，我。。。。

就是给了两个序列，序列a肯定包含序列b，然后给了一个删除序列，删除给定位置的字符，然后依照顺序删，看最多能删几个

思路：一开始肯定想的是直接遍历，然后用个标记数组直接记录哪个被删了，然后就T了

范围是 (1 ≤ |p| < |t| ≤ 200 000).然后我们想下，我们就是想求一个看能最多删几个的东西，去遍历可以得到，但是一般遍历能得到的东西，我们就可以想到二分，

如果删这么多满足的话，就继续往后二分，如果不行往前二分，时间复杂度就可以满足了

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <set>
#include <map>
using namespace std;
const int maxn = 1e6+;
char a[maxn];
char b[maxn];
char tmp[maxn];
int c[maxn],n;
bool slove(int pos)
{
    strcpy(tmp,a);
    for(int i=;i<pos;i++)
        tmp[c[i]-] = ;
    int res = ;
    for(int i=;i<n;i++)
    {
        if(tmp[i]==b[res])
            res++;
        if(res==strlen(b))
            return true;
    }
    if(res==strlen(b))
        return true;
    else
        return false;
}
int main()
{
    scanf("%s %s",a,b);
    n = strlen(a);
    for(int i=;i<n;i++)
        scanf("%d",&c[i]);
    int l = ,r = n;
    int k = ;
    while(k--)
    {
        int mid = (l+r)/;
        if(slove(mid))
            l = mid;
        else
            r = mid;
    }
    printf("%d\n",l);
    return ;
}

要熟练掌握二分思想和满足二分的情况

刷多点题提高敏感度