import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))


N,K = MI()
A = LI()
for i in range(N):
    A[i] -= K
mod = 10**9+7
A = [0]+A

# 和が0以上になる選び方を数え上げる

dp = [[0]*20001 for _ in range(N+1)]  # dp[i][j] = 生徒1~iの中から選ぶ時、和がj-10000になるような選び方
dp[0][10000] = 1
for i in range(1,N+1):
    a = A[i]
    for j in range(20001):
        dp[i][j] = dp[i-1][j]
        if 0 <= j-a <= 20000:
            dp[i][j] += dp[i-1][j-a]
            dp[i][j] %= mod

ans = -1
for i in range(10000,20001):
    ans += dp[-1][i]
    ans %= mod

print(ans)