s = [i for i in input()]
t = [i for i in input()]
n = len(s)
m = len(t)
arr = [int(x) for x in input().split()]
def helper(mid):
temp = s.copy()
i,j = 0,0
for k in range(mid):
temp[arr[k]-1] = '0'
while(i<n or j< m):
if i== n or j== m:
break
if temp[i] == t[j]:
i += 1
j +=1
else:
i += 1
if j == m:
return True
return False
l,r= 0,n-1
ans = 0
while(l<= r):
mid = (l+r)//2
if helper(mid):
ans = max(ans, mid)
l = mid +1
else:
r = mid-1
print(ans)
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |