Codeforces Round #402 (Div. 2)D. String Game【二分】

D. String Game

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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.

题目大意：

给你两个字符串，再给你一个删除的序列，ai表示要把原字符串1中的第i个字符去掉。

问最多可以按照顺序删除字符串1中的字符多少个，使得字符串1剩余部分还能包含一个相对位子的字符串b.

思路：

很明显，按照顺序删除字符串1中的字符，删除的越多，那么对应字符串1包含字符串b的可能性就越小。

所以这里包含一个单调性，我们可以二分删除字符的个数，再之后暴力判断字符串1即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char a[200500];
char b[200500];
int del[200500];
int vis[200500];
int lena,lenb;
int Slove(int mid)
{
    memset(vis,0,sizeof(vis));
    for(int i=0;i<=mid;i++)
    {
        vis[del[i]-1]=1;
    }
    int now=0;
    for(int i=0;i<lena;i++)
    {
        if(vis[i]==0)
        {
            if(a[i]==b[now])
            {
                now++;
            }
        }
    }
    if(now==lenb)return 1;
    else return 0;
}
int main()
{
    while(~scanf("%s%s",a,b))
    {
        lena=strlen(a);
        lenb=strlen(b);
        for(int i=0;i<lena;i++)scanf("%d",&del[i]);
        int ans=-1;
        int l=0;
        int r=lena-1;
        while(r-l>=0)
        {
            int mid=(l+r)/2;
            if(Slove(mid)==1)
            {
                l=mid+1;
                ans=mid;
            }
            else r=mid-1;
        }
        printf("%d\n",ans+1);
    }
}