#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

ll dp[65][65][6010];
signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, m;
    cin >> n >> m;
    ll sum = 0;
    vector<ll> a(n), r(m), b(m);
    REP(i, n) cin >> a[i], sum += a[i];
    REP(i, m) cin >> r[i];
    REP(i, m) cin >> b[i];

    sort(ALL(a), greater<>());
    sort(ALL(r), greater<>());
    sort(ALL(b), greater<>());

    vector<ll> sumr(r), sumb(b);
    FOR(i, 1, m) sumr[i] += sumr[i-1], sumb[i] += sumb[i-1];

    REP(i, 65) REP(j, 65) REP(k, 6010) dp[i][j][k] = LLINF;
    dp[0][0][3005] = 0;
    REP(i, n) REP(j, m+1) {
        if(i-j<0 || i-j>m) continue;
        REP(k, 6010) {
            if(dp[i][j][k] == LLINF) continue;
            // i問目に赤を割り当てる場合
            if(IN(0LL, 6010LL, k+r[j]-a[i]) && j<m) {
                chmin(dp[i+1][j+1][k+r[j]-a[i]], dp[i][j][k] + max(0LL,a[i]-r[j]));
            }
            // 黒を割り当てる
            if(i-j<m) {
                chmin(dp[i+1][j][k], dp[i][j][k] + max(0LL,a[i]-b[i-j]));
            }
        }
    }

    ll ret = LLINF;
    REP(i, n+1) {
        if(n-i-1 >= m) continue;
        REP(j, 6010) {
            ll rest_r = j-3005;
            rest_r += sumr[m-1] - (i==0?0:sumr[i-1]);
            if(rest_r < 0) continue;
            ll use_r = (i==0?0:sumr[i-1])-(j-3005);
            ll need_b = sum - use_r;
            ll rest_b = (i==n?0:sumb[n-i-1]) - need_b;
            rest_b += sumb[m-1]-(i==n?0:sumb[n-i-1]);
            if(rest_b < 0) continue;

            chmin(ret, dp[n][i][j]);
        }
    }
    if(ret == LLINF) cout << -1 << endl;
    else cout << ret << endl;

    return 0;
}



Measured memory_bytes: 201592