#include <bits/stdc++.h>
using namespace std;
void print_result(int n, int weight_max, vector<int> weight_array, vector<vector<int> > a) {
    int num = 0;
    int locate = weight_max - 1;
    for (int i = 0; i < n; i++) {
        int ii = n - i - 1;
        if (ii == 0) {
            if (a[ii][locate] != 0)
                num++;
        } else if (a[ii][locate] != a[ii - 1][locate]) {
            num++;
            locate -= weight_array[ii];
        }
    }
    printf("%d\n", num);
}

int main() {
    // freopen("in.txt","r",stdin);
    void print_result(int n, int weight_max, vector<int> weight_array, vector<vector<int> > a);
    int n, max_w;
    cin >> n >> max_w;
    max_w++;
    vector<int> weight_array(n), value_array(n);
    vector<vector<int> > p(n);
    for (int i = 0; i < n; i++) {
        p[i].resize(max_w);
        cin >> weight_array[i];
        value_array[i] = 1;
    }
    for (int i = 0; i < max_w; i++) {
        p[0][i] = weight_array[0] <= i ? value_array[0] : 0;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 1; j < max_w; j++) {
            p[i][j] = weight_array[i] <= j ? max(p[i - 1][j], p[i - 1][j - weight_array[i]] + value_array[i])
                                           : p[i - 1][j];
        }
    }

    print_result(n, max_w, weight_array, p);
}