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
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <cstdio>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <cstring>
#define REP(i,x,v)for(int i=x;i<=v;i++)
#define REPD(i,x,v)for(int i=x;i>=v;i--)
#define FOR(i,v)for(int i=0;i<v;i++)
#define FORE(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define FOREACH(i,t) FORE(i,t)
#define REMIN(x,y) (x)=min((x),(y))
#define REMAX(x,y) (x)=max((x),(y))
#define pb push_back
#define sz size()
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define IN(x,y) ((y).find((x))!=(y).end())
#define un(v) v.erase(unique(ALL(v)),v.end())
#define LOLDBG
#ifdef LOLDBG
#define DBG(vari) cerr<<#vari<<" = "<<vari<<endl;
#define DBG2(v1,v2) cerr<<(v1)<<" - "<<(v2)<<endl;
#else
#define DBG(vari)
#define DBG2(v1,v2)
#endif
#define CZ(x) scanf("%d",&(x));
#define CZ2(x,y) scanf("%d%d",&(x),&(y));
#define CZ3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z));
#define ALL(x) (x).begin(),(x).end()
#define tests int dsdsf;cin>>dsdsf;while(dsdsf--)
#define testss int dsdsf;CZ(dsdsf);while(dsdsf--)
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; }
#define INF 1000000001
int w[251];
int p[25];
int n,m;
int dp[1<<24][2];

int main()
{
	CZ2(n,m);
	FOR(i,n)CZ(p[i]);
	random_shuffle(p,p+n);
	FOR(i,m)CZ(w[i]);
    sort(w,w+m);reverse(w,w+m);
    if (m>n) m=n;
    REP(j,m,m+200) w[j]=INF;
    dp[0][0]=dp[0][1]=0;
    REP(b,1,(1<<n)-1)
    {
    	dp[b][0]=100;
        FOR(i,n)
        {
            if ((1<<i)&b)
			{
                int re=b^(1<<i);
                if (dp[re][0]>dp[b][0]) continue;
                if (dp[re][1]+p[i]<=w[dp[re][0]])
				{
					if (dp[b][0]>dp[re][0] || dp[b][1]>dp[re][1]+p[i]) {dp[b][0]=dp[re][0];dp[b][1]=dp[re][1]+p[i];}
                }
                else if (dp[re][0]<dp[b][0])
				{
                    if (p[i]<=w[dp[re][0]+1])
					{
						if (dp[re][0]<dp[b][0]-1 || p[i]<dp[b][1]) {dp[b][0]=dp[re][0]+1;dp[b][1]=p[i];}
					}
				}
			}
        }
    }
	if (dp[(1<<n)-1][0]>=m) puts("NIE");
	else printf("%d",dp[(1<<n)-1][0]+1);


    return 0;
}