Given an array of n elements, you know that all the values in the array are between 1 and m. Besides that, the absolute difference between two adjacent elements is at most 1. Some of the values have been erased from the array and you’re asked to calculate the number of different ways the array can be filled without breaking the conditions.

Input

The first line of the input contains two integers n (1 ≤ n ≤ ) and m (1 ≤ m ≤ 100).

The next line contains n space-separated integers (1 ≤ ≤ m) representing the elements in the array. The value of being 0 denotes the erased value at position i.

Output

The program should print the number of ways to fill the array that satisfy the conditions. The output can be large, so the answer should be taken modulo .