#include <bits/stdc++.h>

using namespace std;
const int N = 110;
int n, m;
int f[N][N];

int main() {
    //文件输入
    freopen("QiaHao_WQ.in", "r", stdin);
    scanf("%d %d", &n, &m);
    f[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        int v;
        scanf("%d", &v);
        for (int j = 0; j <= m; j++) {
            f[i][j] = f[i - 1][j];
            if (j >= v) f[i][j] += f[i][j - v];
        }
    }
    printf("%d\n", f[n][m]);
    return 0;
}