## https://yukicoder.me/problems/no/1886

MOD = 10 ** 9 + 7

      

def main():
    N, K = map(int, input().split())
    A = list(map(int, input().split()))

    dp = [[0] for _ in range(1)]
    dp[0][0] = 1
    max_a = max(A)

    for n in range(N):
        a = A[n]
        new_dp = [[0] * (max_a * m + 1) for m in range(n + 2)]

        for m in range(n + 1):
            for k in range(max_a * m + 1):
                x = dp[m][k]
                new_dp[m][k] += x
                new_dp[m][k] %= MOD

                new_k = min(k + a, max_a * (m + 1))
                new_dp[m + 1][new_k] += x
                new_dp[m + 1][new_k] %= MOD
        
        dp = new_dp

    answer = 0
    for n in range(1, N + 1):
        for k in range(max_a * n + 1):
            if k >= K * n:
                answer += dp[n][k]
                answer %= MOD
    print(answer)
        
    







if __name__ == "__main__":
    main()