#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e4 + 10;
LL f[N];
int w[N];
int main() {
    int m, n;
    scanf("%d%d", &n, &m);
    f[0] = 1;
    for (int i = 1; i <= n; i++) scanf("%d", &w[i]);

    for (int i = 1; i <= n; i++)
        for (int j = w[i]; j <= m; j++)
            f[j] += f[j - w[i]];
    printf("%lld\n", f[m]);
    return 0;
}