1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37

#include <algorithm>
#include <iostream>
using namespace std;

int v[20], p[100005] = { 0 }, DP[1 << 16];

inline int sum(int i, int j) { return p[j + 1] - p[i]; }

int main() {
	int K, N; cin >> K >> N;
	for (int i = 0; i < K; i++) cin >> v[i];
	for (int i = 0; i < N; i++) {
		int c; cin >> c;
		p[i + 1] = c + p[i];
	}

	for (int i = 0; i < (1 << K); i++) if (DP[i] < N) {
		for (int j = 0; j < K; j++) if ((i & 1 << j) == 0) {
			int l = DP[i], h = N;
			while (l + 1 < h) {
				int m = (l + h) / 2;
				sum(DP[i], m) > v[j] ? h = m : l = m;
			}
			DP[i ^ 1 << j] = max(l + 1, DP[i ^ 1 << j]);
		}
	}

	int ans = -1;
	for (int i = 0; i < (1 << K); i++) {
		if (DP[i] == N) {
			int sum = 0;
			for (int j = 0; j < K; j++) if ((i & 1 << j) == 0) sum += v[j];
			ans = max(sum, ans);
		}
	}
	cout << ans << endl;
}