if __name__ == '__main__':
    n, m = map(int, input().split())
    c = list(map(int, input().split()))
    dp = [float('inf') for _ in range(n+1)]
    dp[0] = 0
    for i in range(n+1):
        for j in range(m):
            if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i])

print(dp[n])
 if __name__ == '__main__':
    n, m = map(int, input().split())
    c = list(map(int, input().split()))
    dp = [float('inf') for _ in range(n+1)]
    dp[0] = 0
    for i in range(n+1):
        for j in range(m):
            if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i]) __name__ == '__main__' __name__ '__main__' n, m = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m c = list(map(int, input().split())) c list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split float('inf') for _ in range(n+1) for _ in range(n+1) _ range(n+1) range n+1 n 1 for _ in range(n+1) float('inf') float 'inf' dp = [float('inf') for _ in range(n+1)] dp [float('inf') for _ in range(n+1)] dp[0] = 0 dp[0] dp 0 0 for i in range(n+1):
        for j in range(m):
            if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i]) i range(n+1) range n+1 n 1 for j in range(m):
            if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i]) j range(m) range m if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i]) i - c[j] >= 0 i - c[j] i c[j] c j 0 dp[i] = min(dp[i-c[j]]+1, dp[i]) dp[i] dp i min(dp[i-c[j]]+1, dp[i]) min dp[i-c[j]]+1 dp[i-c[j]] dp i-c[j] i c[j] c j 1 dp[i] dp i print(dp[n]) print dp[n] dp n n, m = map(int, input().split()) map(int, input().split()) n c = list(map(int, input().split())) list(map(int, input().split())) c dp = [float('inf') for _ in range(n+1)] [float('inf') for _ in range(n+1)] dp m = map(int, input().split()) map(int, input().split()) m
if __name__ == '__main__':
    n, m = map(int, input().split())
    c = list(map(int, input().split()))
    dp = [float('inf') for _ in range(n+1)]
    dp[0] = 0
    for i in range(n+1):
        for j in range(m):
            if i - c[j] >= 0:
                dp[i] = min(dp[i-c[j]]+1, dp[i])

print(dp[n])

