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
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

#define MR 16777216
#define MS 110
#define MT 3628800

//pair < unsigned int, int > t[MR];

int a[MS], c[MS], c1[MS];
int n, m;

int countTrailingZeros(int mask, int n)
{
	REP(i,n)
		if(mask&(1<<i)) return i;
	return -1;
}

inline int go()
{
	REP(i,m) c1[i] = c[i];
	int wsk = 0;
	REP(i,n)
	{
		while(wsk < m && c1[wsk] < a[i])wsk++;
		if(wsk < m) c1[wsk] -= a[i];
		else break;
	}
	return wsk+1;
}

int main()
{	
	scanf("%d%d", &n, &m);
	REP(i,n) scanf("%d", &a[i]);
	REP(i,m) scanf("%d", &c[i]);
	sort(c,c+m);
	reverse(c,c+m);
	if(n <= 10)
	{
		sort(a,a+n);
		int res = m+1;
		do{
			res = min(res, go());
		}while(next_permutation(a,a+n));
		if(res == m+1) printf("NIE\n");
		else printf("%d\n", res);
		return 0;
	}
	/*int end = 1<<n;
	REP(i,n) t[1<<i] = MP(a[i],1<<i);
	FOR(mask,1,end)
	{
		//wylicz sume wag dla kazdego podzbioru
		//replace the following line to reduce constant
		int submask = 1<<countTrailingZeros(mask,n);
		t[mask].ST = t[mask-submask].ST+t[submask].ST;
		t[mask].ND = mask;
	}
	sort(t,t+end);	
	int actual = end-1;
	int res = 0;
	FORD(i,end,1)
	{
		if((t[i].ND|actual) == actual && t[i].ST <= c[res])
		{
			res++;
			actual -= t[i].ND;
		}
		if(!actual) break;
		if(res == m) break;
	}
	if(actual) res = m+1;*/
	sort(a,a+n);
	int res = min(res, go());
	reverse(a,a+n);
	res = min(res,go());
	srand((int)time(NULL));
	REP(i,MT)
	{
		random_shuffle(a,a+n);
		res = min(res, go());
	}
	if(res == m+1) printf("NIE\n");
	else printf("%d\n", res);
	return 0;
}