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 JAVA):

Solution:
import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class VentureCup
{
	public static void main (String[] args) throws java.lang.Exception
	{
		FastReader in = new FastReader();
		PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		Solution solution = new Solution();
		solution.solve(in, out);
		out.flush();
		out.close();
	}
}


class Solution {
    int N, K;
    long total;
    int[] A;
    long mod = 1000000007;
    long[][][] T;
    public void solve(FastReader in, PrintWriter out) {
      int tc = 1;
      // int tc = in.nextInt();
      for (int t = 0; t < tc; t++) {
        N = in.nextInt();
        K = in.nextInt();
        A = new int[N+1];
        total = 0;
        for (int i = 0; i < N; i++) A[i]=in.nextInt();
        Arrays.sort(A,0,A.length-1);
        A[N] = A[N-1];
        T = new long[N][(N+2)/2][K+1];
        for (int i = 0; i < N; i++)
          for (int j = 0; j < T[0].length; j++)
            for (int k = 0; k < K+1; k++)
              T[i][j][k] = -1;

        out.println(dp(0, 0, 0));
      }
    }

    public long dp(int i, int numOpen, int sumImbalance) {
      if (i == N) {
        if (numOpen == 0 && sumImbalance <= K) return 1;
        return -1;
      }
      if (sumImbalance > K) {
        return -1;
      }
      if (numOpen >= T[0].length || numOpen < 0) {
        return -1;
      }
      if (T[i][numOpen][sumImbalance] != -1) {
        return T[i][numOpen][sumImbalance];
      }
      long total = 0;
      long single = dp(i+1, numOpen, sumImbalance + (A[i+1] - A[i]) * (numOpen));
      if (single != -1) {
        // case ()
        total = (total + single) % mod;
        // case ?
        if (numOpen != 0) {
          total = (total + ((single * numOpen) % mod)) % mod;
        }
      }

      // case (
      long open = dp(i+1, numOpen+1, sumImbalance + (A[i+1] - A[i]) * (numOpen + 1));
      long close = dp(i+1, numOpen-1, sumImbalance + (A[i+1] - A[i]) * (numOpen - 1));

      if (open != -1) {
        total = (total + open) % mod;
      }
      if (close != -1 && numOpen > 0) {
        total = (total + ((close * numOpen) % mod)) % mod;
      }
      T[i][numOpen][sumImbalance] = total;
      return total;
    }

    // public void go(int mask, int sum) {
    //   if (mask == ((1 << N) - 1)) {
    //     if (sum <= K) total++;
    //     return;
    //   }
    //
    //   int left = -1;
    //   for (int l = 0; l < N; l++) {
    //     if (((1 << l) & mask) == 0) left = l;
    //   }
    //   mask |= (1 << left);
    //
    //   int subset = ((1 << N) - 1) ^ mask;
    //   int ss = subset;
    //   while (true) {
    //     go(mask | ss, sum + groupSum((1 << left) | ss));
    //     if (ss == 0) break;
    //     ss = (ss - 1) & subset;
    //   }
    // }
    //
    // public int groupSum(int ss) {
    //   int min = Integer.MAX_VALUE;
    //   int max = Integer.MIN_VALUE;
    //   for (int i = 0; i < N; i++) {
    //     if (((1 << i) & ss) != 0) {
    //       min = Math.min(min, A[i]);
    //       max = Math.max(max, A[i]);
    //     }
    //   }
    //   return max - min;
    // }
}


/*******************************************************************************
********************************************************************************
********************************************************************************/

class FastReader {
    BufferedReader br;
    StringTokenizer st;
    public FastReader() { br = new BufferedReader(new InputStreamReader(System.in)); }
    String next() {
        while (st == null || !st.hasMoreElements()) {
            try { st = new StringTokenizer(br.readLine()); }
            catch (IOException  e) { e.printStackTrace(); }
        }
        return st.nextToken();
    }
    int nextInt() { return Integer.parseInt(next()); }
    long nextLong() { return Long.parseLong(next()); }
    double nextDouble() { return Double.parseDouble(next()); }
    String nextLine() {
        String str = "";
        try { str = br.readLine(); }
        catch (IOException e) { e.printStackTrace(); }
        return str;
    }
}