3091

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    const int INF = 1000 * 1000 * 1000;
    int n, m;
    fin >> n >> m;
    vector<int> ans(m + 1, INF);
    ans[0] = 0;
    vector<int> vec(n);
    for (int i = 0; i < n; i++) fin >> vec[i];
    for (int i = 0; i < n; i++)
        for (int j = m - vec[i]; j >= 0; j--)
            ans[j + vec[i]] = min(ans[j + vec[i]], ans[j] + 1);

    fout << (ans[m] == INF ? 0 : ans[m]) << endl;

    fin.close();
    fout.close();
    return 0;
}