import
  algorithm, bitops, deques, heapqueue, math, macros, sets, sequtils,
  strformat, strutils, sugar, tables

proc input*(): string {.inline.} = stdin.readLine
proc inputs*(): seq[string] {.inline.} = stdin.readLine.split
proc inputInt*(): int {.inline.} = stdin.readLine.parseInt
proc inputInts*(): seq[int] {.inline.} = stdin.readLine.split.map(parseInt)
proc chmax*[T: SomeNumber](n: var T, m: T) {.inline.} = n = max(n, m)
proc chmin*[T: SomeNumber](n: var T, m: T) {.inline.} = n = min(n, m)
proc `%=`*[T: SomeInteger](n: var T, m: T) {.inline.} = n = floorMod(n, m)

when isMainModule:
  const MOD = 10^9 + 7
  var N, K: int
  (N, K) = inputInts()
  let A = inputInts()

  var dp: array[101, array[101, array[10001, int]]]
  for i in 0..<N:
    dp[i][0][0] = 1
    for j in 0..i:
      for k in 0..10000 - A[i]:
        dp[i + 1][j][k] += dp[i][j][k]
        dp[i + 1][j][k] %= MOD
        dp[i + 1][j + 1][k + A[i]] += dp[i][j][k]
        dp[i + 1][j + 1][k + A[i]] %= MOD
  
  var ans: int
  for i in 1..N:
    for j in 0..10000:
      if i*K <= j:
        ans += dp[N][i][j]
        ans %= MOD
  echo ans