dp

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}



int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m; cin>>n>>m;
    vector <int> a(n+1); for (int i = 1; i <= n; ++i) cin>>a[i];
    vector <vector<int>> dp(m+1, vector <int> (n+1, -1));
    for (int j = 0; j <= n; ++j) dp[0][j] = 0;

    for (int i = 1; i <= m; ++i){
        for (int j = 1; j <= n; ++j){
            if (dp[i][j-1] != -1){
                dp[i][j] = dp[i][j-1];
            }
            if (i - a[j] >= 0 && dp[i - a[j]][j - 1] != -1){
                if (dp[i][j] == -1){
                    dp[i][j] = dp[i - a[j]][j - 1] + 1;
                }
                else{
                    dp[i][j] = min(dp[i][j - 1], dp[i - a[j]][j - 1] + 1);
                }
            }
        }
    }
    if (dp[m][n] == -1){
        cout<<0;
        exit(0);
    }
    cout<<dp[m][n];
}