#include <iostream>

#include <string>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <vector>

#include <queue>

#define range(i,a,b) for(int i=a;i<=b;++i)

#define LL long long

#define rerange(i,a,b) for(int i=a;i>=b;--i)

#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))

using namespace std;

int n,v;

LL val[],dp[];

void init(){

    cin>>v>>n;

    range(i,,v-)cin>>val[i];

    fill(dp,);

    dp[]=;

}

void solve(){

    range(i,,v-)range(j,val[i],n)dp[j]+=dp[j-val[i]];

    cout<<dp[n]<<endl;

}

int main() {

    init();

    solve();

    return ;

}