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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <exception>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <set>
#include <sstream>
#include <stdexcept>
#include <string>
#include <tuple>
#include <typeinfo>
#include <vector>

#include <unordered_set>
#include <unordered_map>
#include <bitset>

using namespace std;
#define rep(i,b) for(auto i=(0);i<(b);++i)
#define fo(i,a,b) for(auto i=(a);i<=(b);++i)
#define ford(i,a,b) for(auto i=(a);i>=(b);--i)
#define fore(a,b) for(auto &a:(b))
#define v vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define clr(x,a) memset(x,a,sizeof(x))

template <typename T, size_t N> struct ma : array<T,N> { T& operator[](size_t n) {
#ifdef DEBUG
           assert(n < N);
#endif
return (*static_cast<array<T,N>*>(this))[n]; } } ; typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<string> vs; typedef ostringstream oss; typedef istringstream iss;
template<class T> string to_str(const T &a) { oss os; os << a; return os.str(); }
template<> string to_str<ld>(const ld& a) { oss os; os.precision(10); os.setf(ios::fixed); os << a; return os.str(); }
template<class T> T from_str(const string &s) { iss is; T val; is >> val; return val; }

int cond = (ll)100;
#define db(x...) { if (cond > 0) { cond--; rep (xxx, 1) cerr << __LINE__ << " " << #x << " " << x << endl; cerr.flush(); } }



#define ui int
int can[2][1<<24];
int n, m;
vector<ui> a, c;

void solve() { 
    scanf("%d%d", &n, &m);
    a.resize(n);
    c.resize(m);
    rep (i, n) scanf("%d", &a[i]);
    rep (j, m) scanf("%d", &c[j]);
    sort(all(a), greater<ui>());
    sort(all(c), greater<ui>());
    m = min(m, n);
    clr(can[0], -1);
    can[0][0] = 0;
    rep (st, m) {
        int cur = st%2;
        int next = (st+1)%2;

        clr(can[next], -1);

        rep (i, 1<<n) {
            if (can[cur][i] >= 0) {
                bool ok = true;
                rep (j, n) {
                    int cand = i | (1<<j);
                    if (i != cand && can[cur][cand] != -1) { ok = false; break; }
                }
                if (ok) {
                    can[next][i] = c[st];
                }
                else can[next][i] = -2;
            }
            int ile = can[next][i];
            if (ile >= 0) {
                if ((0 == (i & 1)) && (i>>1) && (
                        can[next][i>>1] >= ile
                        || can[next][i>>1] <= -3 - ile)
                     ) {
                    can[next][i] = -3 - ile;
                    continue;
                }
                bool ok = 1;
                ford (j, n-1, 1) if (!(i&(1<<j-1))&&(i&(1<<j))) {
                    int ni = i^(1<<j)^(1<<j-1);
                    if (can[next][ni] == ile || can[next][ni] == -3 - ile) {
                        ok = 0;
                        break;
                    }
                }
                if (!ok) {
                    can[next][i] = -3 - ile;
                    continue;

                }

                bool check = 0;
                    ford (j, n-1, 0)
                    {
                        int nowy = i | (1<<j);
                        if (nowy != i) {
                            int nval = ile - (int)a[j];
                            if (nval >= 0) {
                                can[next][nowy] = max(can[next][nowy], nval);
                                check = 1;
                            }
                            else
                                break;
                        }
                    }
                if (check) can[next][i] = -2;
            }
        }
        if (can[next][(1<<n)-1] >= 0) {
            cout << st + 1 << endl;
            return;
        }
    }
    cout << "NIE" << endl;
}

int main(int argc, char ** argv) {
    ios::sync_with_stdio(false);
    //  freopen("../1.in","r",stdin); 
    //  freopen("../2.in","r",stdin); 
    //  freopen("../3.in","r",stdin); 
    //  freopen("../A-small.in","r",stdin); freopen("../A-small.out","w",stdout);
    //  freopen("../A-small-attempt0.in","r",stdin);freopen("../A-small-attempt0.out","w",stdout);
    //  freopen("../A-small-attempt1.in","r",stdin);freopen("../A-small-attempt1.out","w",stdout);
    //  freopen("../A-small-attempt2.in","r",stdin);freopen("../A-small-attempt2.out","w",stdout);
    //  freopen("../A-large.in","r",stdin); freopen("../A-large.out","w",stdout)

    int t = 1;
    fo (i, 1, argc - 1) {
        if (string(argv[i]) == "q")
            cond = 1000;
        if (string(argv[i]) == "all")
            t = 1000;
    }
    fo (i, 1, t) {
        solve();
    }
    return 0;
}