Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Tavas and Malekas

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTavas 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*_{1} < *x*_{2} < ... < *x*_{k} where *p* matches *s*. More formally, for each *x*_{i} (1 ≤ *i* ≤ *k*) he condition *s*_{xi}*s*_{xi + 1}... *s*_{xi + |p| - 1} = *p* is fullfilled.

Then Malekas wrote down one of subsequences of *x*_{1}, *x*_{2}, ... *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^{9} + 7.

Input

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^{6} and 0 ≤ *m* ≤ *n* - |*p*| + 1).

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

The next line contains *m* space separated integers *y*_{1}, *y*_{2}, ..., *y*_{m}, Malekas' subsequence (1 ≤ *y*_{1} < *y*_{2} < ... < *y*_{m} ≤ *n* - |*p*| + 1).

Output

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

Examples

Input

6 2

ioi

1 3

Output

26

Input

5 2

ioi

1 2

Output

0

Note

In the first sample test all strings of form "ioioi?" where the question mark replaces arbitrary English letter satisfy.

Here |*x*| denotes the length of string x.

Please note that it's possible that there is no such string (answer is 0).

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2023 20:23:36 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|