MOD = 10 ** 9 + 7
n, k = map(int, input().split())
a = [int(x) - k for x in input().split()]
B = 100 * 100
dp = [0] * (2 * B + 1)
dp[B] = 1
for x in a:
    ndp = dp.copy()
    for i in range(2 * B + 1):
        if 0 <= i + x <= 2 * B:
            ndp[i+x] += dp[i]
            ndp[i+x] %= MOD
    dp = ndp
ans = sum(dp[B:]) % MOD
print(ans-1)