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 " " nas t ya " " n as t ya " " n as t y a " " n a s t y a " " n a s t y a " " n a s t y a ". 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 | < | 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 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. In the first sample test sequence of removing made by Nastya looks like this: " ababcba " " abab c ba " " ab a b c ba " " ab a b c ba " Nastya can not continue, because it is impossible to get word " abb " from word " a b a b c ba ". So, Nastya will remove only three lette