Link to this code: https://cses.fi/paste/2133008243242e40421d59/
inf = 10**9
n, k = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort(reverse=True)

mini = [0]+k*[inf]
for a in A:
    for i in range(a, k+1):
        mini[i] = min(mini[i], mini[i-a] + 1)
res = mini[k]
print(res if res < inf else -1)