#include <iostream>
#include <stdlib.h>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <limits>
#include <cmath>
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    long long x, c, mn;
    const long long LLMAX = __LONG_LONG_MAX__;
    cin >> n >> x;

    long long coins[n];
    for (int i = 0; i < n; i++) {
        cin >> c;
        coins[i] = c;
    }

    sort(coins.begin(), coins.end());

    vector<long long> dp = {0};
    for (int i = 1; i <=x; i++){
        mn = LLMAX;
        for (auto c: coins) {
            if (i-c >= 0) {
                if (dp[i-c] != LLMAX) {
                    mn = min(mn, dp[i-c] + 1);
                }
            }

        }
        dp.push_back(mn);
    }

    if (dp[x] == LLMAX) {
        cout << -1;
    } else {
        cout << dp[x];
    }

    return 0;

}