Palindromic Subsequence

A palindrome is a string that reads the same backward as forward. For example, BANANAB is a palindrome and BANANAS is not.

A subsequence is a string obtained by deleting zero or more characters from the original string. For example, ANNA is a subsequence of BANANAS.

You are given a string $S$ and several distinct positions of $S$, called the special positions. Among the subsequences of $S$, find one that is a palindrome and contains as many special positions as possible. If several palindromic subsequences contain that maximum number of special positions, take the longest one among them and report its length.

The first line contains a string $S$ of uppercase letters. The length of $S$ is between 1 and 2000.

The second line contains an integer $N$ ($0 \le N \le |S|$), followed by $N$ distinct integers separated by spaces that give the special positions. Each integer is between 1 and $|S|$, and they are not necessarily sorted. The first character of $S$ is at position 1.

Print a single integer, the length of the palindromic subsequence described above.