def min_cost_with_num(single=False,INF=float("inf")):
    """
    :param larger_num:     False = (個数 = K)の時の最小価値
                           True  = (個数 >= K)の時の最小価値
    :param larger_weight:  False = (重さ = W)の時の最小価値
                           True  = (重さ >= W)の時の最小価値
    :param single:         False = 重複あり

    dp[num (<=K)][weight (<=W)] = 個数と重さを固定した時の最小価値
    """
    dp_max = 0   # 総和価値の最大値
    dp = [[dp_max]*(W+2) for _ in range(K+2)]
    dp[0][0] = 1   # 重さ 0 の時は価値 0

    for item in range(N):
        if single:
            S = range(min2(K,item+1)+2)[::-1]
        else:
            S = range(min2(K,item+1)+2)
        for num in S:
            if num==0:
                dp[min2(num+1,K+1)][min2(weight_list[item],W+1)]+=dp[0][0]
            else:
                for weight in range(W+2):
                    if dp[num][weight]!=dp_max:
                        dp[min2(num+1,K+1)][min2(weight+weight_list[item],W+1)]+=dp[num][weight]
    return dp[K][W]+dp[K][W+1]

##########################################################
def max2(x,y):
    return x if x > y else y

def min2(x,y):
    return x if x < y else y
##########################################################
def example():
    global input
    example = iter(
        """
2 2
1 3




        """
            .strip().split("\n"))
    input = lambda: next(example)
##########################################################
import sys
from bisect import *
input = sys.stdin.readline

# example()
MOD=10**9+7

N,M=map(int, input().split())
A=list(map(int, input().split()))

weight_list = []
for i in range(N):
    """ cost と weight が逆転して入力されている場合有り """
    weight_list.append(A[i])

res=0
for K in range(1,N+1):
    W=M*K
    cnt=min_cost_with_num(single=True)
    res+=cnt
    res%=MOD
print(res)