DogDogBark#2174

DogDogBark

1 second
64 megabytes
Easy

Gabriel works at a famous company. The work is not very difficult, but it takes a lot of time. Mainly, Gabriel searches for certain information in one book and copies it to another. Gabriel does not care much about who needs the results; the main thing is that the work is well paid. Gabriel joined the company not long ago, so he works diligently and gets very tired by the end of the day. By the end of the day, all the characters in the book seem to merge into one long line, so all this valuable data becomes just one long string, but he has to keep working with it... Maybe, the boss will notice how hard Gabriel works and will give him a promotion...

But... Oh no... While Gabriel was dreaming, he forgot what he was supposed to be looking for in the first book. After a break and a cup of "Lipton" tea, he remembered a few things. First, he remembered that he had to look for a string in the first book. Second, he remembered he was supposed to write down the positions where this string occurs in the second book, and that he has already written them all down.

Input

The input file contains several tests. The description of each test starts with the natural numbers (1 \le n \le 1000000) — the number of characters in the first book — and (1 \le k \le n) — the number of positions where Gabriel already found occurrences of the required string in the text (i.e., the number of numbers in the second book). The second line of the test description contains the text from the first book — a sequence of characters with ASCII codes greater than . The third line of the test description contains position numbers that have been written in the second book.

The line with n=k=0 marks the end of the tests; this test and all data after it should not be processed.

Output

For each test, output one line. If there exists a string that occurs in the text in exactly those positions given in the second book, print a single line "Correct. Length = x..y.", where and are the minimal and maximal possible length of the required string. If no such solution exists, output a single line "Mistake."

Examples

Example 1

Loading
Loading