Problem: There are n students in a class working on group projects. The students will divide into groups (some students may be in groups alone), work on their independent pieces, and then discuss the results together. It takes the i-th student ai minutes to finish his/her independent piece.

If students work at different paces, it can be frustrating for the faster students and stressful for the slower ones. In particular, the imbalance of a group is defined as the maximum ai in the group minus the minimum ai in the group. Note that a group containing a single student has an imbalance of 0. How many ways are there for the students to divide into groups so that the total imbalance of all groups is at most k?

Two divisions are considered distinct if there exists a pair of students who work in the same group in one division but different groups in the other.

Input

The first line contains two space-separated integers n and k (1 ≤ n ≤ 200, 0 ≤ k ≤ 1000) — the number of students and the maximum total imbalance allowed, respectively.

The second line contains n space-separated integers ai (1 ≤ ai ≤ 500) — the time it takes the i-th student to complete his/her independent piece of work.

Output

Print a single integer, the number of ways the students can form groups. As the answer may be large, print its value modulo 109 + 7.

Examples

Input

3 2
2 4 5


Output

3


Input

4 3
7 8 9 10


Output

13


Input

4 0
5 10 20 21


Output

1

Note

In the first sample, we have three options: 

  * The first and second students form a group, and the third student forms a group. Total imbalance is 2 + 0 = 2. 
  * The first student forms a group, and the second and third students form a group. Total imbalance is 0 + 1 = 1. 
  * All three students form their own groups. Total imbalance is 0. 



In the third sample, the total imbalance must be 0, so each student must work individually.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 200 + 2;
const int K = 1000 + 2;
int n, k, f[2][N][K], a[N];
void AddMod(int &a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
void Solve() {
  sort(a + 1, a + 1 + n);
  f[0][0][0] = 1;
  int cur = 0, nex = 1;
  for (int i = 1; i <= n; ++i, swap(cur, nex)) {
    for (int j = 0; j <= n; ++j)
      for (int l = 0; l <= k; ++l) f[nex][j][l] = 0;
    for (int j = 0; j < n; ++j)
      for (int l = 0; l <= k; ++l) {
        int ll = l + j * (a[i] - a[i - 1]);
        if (ll > k) break;
        AddMod(f[nex][j + 1][ll], f[cur][j][l]);
        AddMod(f[nex][j][ll], (long long)f[cur][j][l] * (j + 1) % MOD);
        if (j > 0) AddMod(f[nex][j - 1][ll], (long long)f[cur][j][l] * j % MOD);
      }
  }
  printf("%lld", accumulate(f[cur][0], f[cur][0] + 1 + k, 0LL) % MOD);
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  Solve();
  return 0;
}