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: a1... 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 a1, a2, ..., a|t| of letter indices that specifies the order in which Nastya removes letters of t (1 ≤ ai ≤ |t|, all ai are distinct).

Output

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

Examples

input

ababcbaabb5 3 4 1 7 6 2

output

3

input

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

题目链接：http://codeforces.com/problemset/problem/779/D

  16级省赛选拔防AK题，我发现cf好喜欢二分答案啊，我总感觉以前见过这个题，忘记了当时做没做出来，反正现在做出来了

题目的意思是说给你两个字符串，然后给你一串序列，然后我们按序列删除字母，删除后第一个串中还需要继续包括第二个串，求这个序列最长为多少。

匹配的时候我直接暴力的竟然没有超时，然后我们在序列中二分，然后就过了。。。好水

代码：

#include <cstdio>#include <cstring>#include <iostream>#include <string>using namespace std;string s;string ss;string S;int a[300000];bool judge(){    int len=ss.length();    int top=0;    int L=S.length();    for(int i=0;i<L;i++){        if(ss[top]==S[i]){            top++;        }    }    if(top==len)        return true;    return false;}int main(){    cin>>s;    cin>>ss;    int len=s.length();    for(int i=0;i<len;i++){        scanf("%d",&a[i]);    }    int ans=0;    /*for(int i=0;i<len;i++){        s[a[i]-1]='*';        bool flag=judge();        if(!flag){            break;        }        ans++;    }*/    int l=0,r=len-1;    while(l<=r){        int mid=(l+r)>>1;        S=s;        for(int i=0;i<=mid;i++){            S[a[i]-1]='*';        }        bool flag=judge();        if(!flag){            r=mid-1;        }        else{            l=mid+1;        }    }    printf("%d\n",l);    return 0;}