Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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

D. Increase Sequence

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPeter has a sequence of integers *a*_{1}, *a*_{2}, ..., *a*_{n}. Peter wants all numbers in the sequence to equal *h*. He can perform the operation of "adding one on the segment [*l*, *r*]": add one to all elements of the sequence with indices from *l* to *r* (inclusive). At that, Peter never chooses any element as the beginning of the segment twice. Similarly, Peter never chooses any element as the end of the segment twice. In other words, for any two segments [*l*_{1}, *r*_{1}] and [*l*_{2}, *r*_{2}], where Peter added one, the following inequalities hold: *l*_{1} ≠ *l*_{2} and *r*_{1} ≠ *r*_{2}.

How many distinct ways are there to make all numbers in the sequence equal *h*? Print this number of ways modulo 1000000007 (10^{9} + 7). Two ways are considered distinct if one of them has a segment that isn't in the other way.

Input

The first line contains two integers *n*, *h* (1 ≤ *n*, *h* ≤ 2000). The next line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 2000).

Output

Print a single integer — the answer to the problem modulo 1000000007 (10^{9} + 7).

Examples

Input

3 2

1 1 1

Output

4

Input

5 1

1 1 1 1 1

Output

1

Input

4 3

3 2 1 1

Output

0

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/29/2017 12:16:19 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|