#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 30, M = 10010;

ll f[N][M];
int n, m;
int a[N];

int main()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i++) cin >> a[i];

    f[0][0] = 1;

    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j <= m; j++)
        {
            f[i][j] = f[i-1][j];

            if(j >= a[i])
            f[i][j] += f[i][j-a[i]];
        }
    }

    cout << f[n][m] << endl;
    return 0;

}