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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cstdio>
#include <utility>
#include <iomanip>
#include <assert.h>
#define MP make_pair
#define PB push_back
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#ifdef LOCAL
#define debug(x) {cerr <<#x <<" = " <<x <<"\n"; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(x)
#define debugv(x)
#endif
#define make(type, x) type x; cin>>x;
#define make2(type, x, y) type x, y; cin>>x>>y;
#define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z;
using namespace std;
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}

typedef pair<short int, unsigned int> PUS;
const int N = 24;
const int POW = (1 << N) + 5;
ll item[N + 5];
ll bag[5 * N + 5];
unsigned dp[POW];
/* PUS AddItemToPair(PUS& p, int ind) {
  if (p.second + item[ind] > bag[p.first]) {
    if (item[ind] > bag[p.first + 1]) {
      return MP(N + 2, 0);
    }
    return MP(p.first + 1, item[ind]);
  } else {
    return MP(p.first, p.second + item[ind]);
  }
} */
int main() {
  // nie zapomnij o ll
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  
  make2(int, n, m);
  RE (i, n) {
    cin>>item[i];
  }
  RE (i, m) {
    cin>>bag[i];
  }
  sort(bag + 1, bag + 1 + m, greater<int>());
  
  
  RE (mask, (1 << n) - 1) {
    dp[mask] = ((N + 2) << 27);
    REP (bit, n) {
      if (mask & (1 << bit)) {
        unsigned prev = dp[mask - (1 << bit)];
        unsigned int prev_bag = (prev >> 27);
        unsigned prev_cap = prev - (prev_bag << 27);
        int new_item = item[bit + 1];
        if (prev_cap + new_item > bag[prev_bag]) {
          if (new_item <= bag[prev_bag + 1]) {
            dp[mask] = min(dp[mask], ((prev_bag + 1) << 27) | new_item);
          }
        } else {
          dp[mask] = min(dp[mask], prev + new_item);
        }
      }
    }
  }
  int res = (dp[(1 << n) - 1] >> 27);
  if (res > n) {
    cout<<"NIE"<<endl;
  } else {
    cout<<res<<endl;
  }
    
      
      
  // nie zapomnij o ll
  return 0;
}