/* -*- coding: utf-8 -*-
 *
 * 1238.cc:  No.1238 選抜クラス - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_A = 100;
const int MAX_S = MAX_N * MAX_A;
const int MOD = 1000000007;

/* typedef */

/* global variables */

int as[MAX_N], dp[MAX_N + 1][MAX_S + 1];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  dp[0][0] = 1;
  int asum = 0;

  for (int i = 0; i < n; i++) {
    for (int j = i; j >= 0; j--)
      for (int l = 0; l <= asum; l++)
	addmod(dp[j + 1][l + as[i]], dp[j][l]);
    asum += as[i];
  }

  int sum = 0;
  for (int i = 1; i <= n; i++)
    for (int j = i * k; j <= asum; j++)
      addmod(sum, dp[i][j]);

  printf("%d\n", sum);
  return 0;
}