1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 22;
const int K = 101;
unordered_set<int> F[N];
int suma[1 << N], bitCnt[1 << N];
int masa[N], plecak[K];
int n, m;

int main() {
	scanf("%d %d", &n, &m);
	REP(i, n) scanf("%d", &masa[i]);
	REP(i, m) scanf("%d", &plecak[i]);
	sort(masa, masa + n); sort(plecak, plecak + m);
	reverse(masa, masa + n); reverse(plecak, plecak + m);
	m = min(n, m);
	REP(i, 1 << n) {
		REP(j, n) if (i & (1 << j)) {
			suma[i] += masa[j];
			++bitCnt[i];
		}
	}
	if (suma[(1 << n) - 1] <= plecak[0]) {
		printf("1\n");
		return 0;
	}
	REP(i, 1 << n) {
		if (suma[i] <= plecak[0]) {
			F[0].insert(i);
		}
	}
	FOR(i, 1, m-1) {
		for (const auto& p : F[i-1]) {
			FOR(q, 1, 1 << (n - bitCnt[p])) {
				int k = 0;
				int wsk = 0;
				int sum = 0;;
				REP(j, (n - bitCnt[p])) {
					while ((p & (1 << wsk))) ++wsk;
					if (q & (1 << j)) {
						k |= (1 << wsk);
						if (suma[k] > plecak[i]) break;
					}
					++wsk;
				}
				if (suma[k] <= plecak[i]) {
					F[i].insert(p | k);
				}
			}
		}
		if (F[i].find((1 << n) - 1) != F[i].end()) {
			printf("%d\n", i+1);
			return 0;
		}
	}
	printf("NIE\n");
	return 0;
}