#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& input, vector<T>& v) { for (auto& elemnt : v)input >> elemnt; return input; }

int main() {
    init();
    
    int w, h;
    cin >> w >> h;
    priority_queue<pair<int, int>> q;
    int in;
    FOR(i, 0, w) {
        cin >> in;
        if(in)q.push({ in,i });
    }

    FOR(i, 0, h) {
        cin >> in;
        if (q.size() < in) {
            cout << "0\n";
            return 0;
        }
        priority_queue<pair<int, int>> p;
        while (!q.empty()) {
            int num, itr;
            tie(num, itr) = q.top(); q.pop();
            if (in)in--, num--;
            if(num)p.push({ num,itr });
        }
        swap(p, q);
    }
    cout << "1\n";
}
