int f(int ind , int n , int x , vector& coins) {

if (x == 0) return 0;

if (x < 0 || ind == n) return INT_MAX;

int take = 1 + f(ind , n , x - coins[ind] , coins);

int nottake = f(ind + 1 , n , x , coins);

return min(take , nottake);

}

void solve()

{

int n , x ; cin >> n >> x;

vector<int>coins(n);

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

int ans = f(0 , n , x , coins);

    if(ans >= 1e9) cout << -1 << endl;

    else cout << ans << endl;

}

void solve() { int n , x;

cin >> n >> x;

vector<int>a(n);

for (int i = 0 ; i < n ; i++)cin >> a[i];

vector<int>prev(x + 1 , 0);

vector<int>curr(x + 1 , 0);


for (int i = 0 ; i <= x; i++)

{

    if (i % a[0] == 0)prev[i] = i / a[0];

    else prev[i] = 1e9;

}

for (int ind = 1 ; ind < n ; ind++)

{

    for (int j = 0 ; j <= x ; j++)

    {

       int notTake = prev[j];

       int take = 1e9;

       if (j >= a[ind]) take = 1 + curr[j - a[ind]];

       curr[j] = min(take , notTake);

    }

    prev = curr;

}

if (prev[x] >= 1e9) cout << -1 << endl;

else cout << prev[x] << endl;

}