Tavas is a strange creature. Usually "zzz" comes out of people's mouth while sleeping, but string s of length n comes out from Tavas' mouth instead.

Today Tavas fell asleep in Malekas' place. While he was sleeping, Malekas did a little process on s. Malekas has a favorite string p. He determined all positions x₁ < x₂ < ... < x_k where p matches s. More formally, for each x_i (1 ≤ i ≤ k) he condition s_xis_xi + 1... s_{xi + |p| - 1} = p is fullfilled.

Then Malekas wrote down one of subsequences of x₁, x₂, ... x_k (possibly, he didn't write anything) on a piece of paper. Here a sequence b is a subsequence of sequence a if and only if we can turn a into b by removing some of its elements (maybe no one of them or all).

After Tavas woke up, Malekas told him everything. He couldn't remember string s, but he knew that both p and s only contains lowercase English letters and also he had the subsequence he had written on that piece of paper.

Tavas wonders, what is the number of possible values of s? He asked SaDDas, but he wasn't smart enough to solve this. So, Tavas asked you to calculate this number for him.

Answer can be very large, so Tavas wants you to print the answer modulo 10⁹ + 7.

The first line contains two integers n and m, the length of s and the length of the subsequence Malekas wrote down (1 ≤ n ≤ 10⁶ and 0 ≤ m ≤ n - |p| + 1).

The second line contains string p (1 ≤ |p| ≤ n).

The next line contains m space separated integers y₁, y₂, ..., y_m, Malekas' subsequence (1 ≤ y₁ < y₂ < ... < y_m ≤ n - |p| + 1).

In a single line print the answer modulo 1000 000 007.