// METHOD - 2

/* CAUTION: The initialisation part of this algorithm is slightly different from others,
                                 V+1 ---->
            -------------------------------------------------------
            |             <------∞(infinite)----->                 |
            |------------------------------------------------------|
            |    |  <------∞ or (j/coin[0] iff j%coin[0]==0---->   |
      (n+1) |  ^ |-------------------------------------------------|
        |   |  | |                                                 |
        |   |  | |                                                 |
        ˅   |  0 |                                                 |
            |  | |                                                 |
            |  | |                                                 |
            |  ˅ |                                                 |
            |    |                                                 |
            |    |                                                 |
            --------------------------------------------------------
*/

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define F first
#define S second
#define PI 3.1415926535897932384626
#define sz(x) ((int)(x).size())

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vull> vvull;
typedef vector<vb> vvb;
typedef vector<vc> vvc;

/************************************************** DEBUGGER *******************************************************************************************************/

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(ld t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(ull t) { cerr << t; }

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(vector <vector<T>> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) { cerr << "{"; _print(p.F); cerr << ","; _print(p.S); cerr << "}"; }
template <class T> void _print(vector <T> v) { cerr << "[ "; for (T i : v) {_print(i); cerr << " "; } cerr << "]"; }
template <class T> void _print(vector <vector<T>> v) { cerr << "==>" << endl; for (vector<T> vec : v) { for(T i : vec) {_print(i); cerr << " "; } cerr << endl; } }
template <class T> void _print(set <T> v) { cerr << "[ "; for (T i : v) {_print(i); cerr << " "; } cerr << "]"; }
template <class T> void _print(multiset <T> v) { cerr << "[ "; for (T i : v) {_print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void _print(map <T, V> v) { cerr << "[ "; for (auto i : v) {_print(i); cerr << " "; } cerr << "]"; }

/*******************************************************************************************************************************************************************/

mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
    uniform_int_distribution<int> uid(0,lim-1);
    return uid(rang);
}

const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;

ll mod_exp(ll a, ll b) { a %= mod; if(a == 0) return 0LL; ll res = 1LL;
                         while(b > 0) { if(b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; }

ll mod_inv(ll a) { return mod_exp(a, mod - 2); } // works only for prime value of "mod"
ll GCD(ll a, ll b) { return (b == 0) ? a : GCD(b, a % b); }

/******************************************************************************************************************************/

vvi dp;

int min_coins(vi &v, int n, int sum) {
    // initialisation of dp matrix

    // 0 coins required for sum == 0
    for(int i = 1; i <= n; i++) dp[i][0] = 0;

    // here INT_MAX-1 represents ∞, 1 is subtracted so as to avoid
    // overflow when 1 will be added to INT_MAX - 1
    for(int j = 0; j <= sum; j++) dp[0][j] = INT_MAX - 1;

    // slightly different part of initialization
    for(int j = 1; j <= sum; j++) {
        if(j % v[0] == 0) dp[1][j] = j / v[0];
        else dp[1][j] = INT_MAX - 1;
    }

    // choice diagram code iterative version
    for(int i = 2; i <= n; i++) {
        for(int j = 1; j <= sum; j++) {
            if(v[i-1] <= j) dp[i][j] = min(1 + dp[i][j - v[i-1]], dp[i-1][j]);
            else dp[i][j] = dp[i-1][j];
        }
    }

    if(dp[n][sum] == INT_MAX - 1) return -1;
    return dp[n][sum];
}

void solve()
{
    int n, sum; cin >> n >> sum;
    vi v(n);
    for(int i = 0; i < n; i++) cin >> v[i];

    dp.resize(n+1);
    for(int i = 0; i <= n; i++) dp[i].resize(sum+1);

    cout << min_coins(v, n, sum) << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());

    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    //     freopen("output.txt", "w", stdout);
    // #endif

    // #ifndef ONLINE_JUDGE
    //      freopen("error.txt", "w", stderr);
    // #endif

    int t = 1;
    // int test = 1;
    // cin >> t;
    while(t--) {
        // cout << "Case #" << test++ << ": ";
        solve();
    }

    return 0;
}