#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
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< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

// しんじるものはすくわれる
// TLEをしないでね！！！！

int dp[61][61][3001] = {{{}}};
int dp2[61][61][3001];

int main() {
  int N, K;
  cin >> N >> K;
  vector< int > A(N), R(K), B(K);
  cin >> A;
  cin >> R >> B;
  sort(begin(A), end(A));
  sort(begin(R), end(R));
  sort(begin(B), end(B));
  int as = accumulate(begin(A), end(A), 0);
  int rs = accumulate(begin(R), end(R), 0); // 初心者か？
  int bs = accumulate(begin(B), end(B), 0);

  int add = 0;
  for(int i = 0; i < N; i++) {
    auto cur = dp;
    auto nxt = dp2;
    if(i % 2)swap(cur, nxt);

    for(int j = 0; j <= K; j++) {
      for(int k = 0; k <= K; k++) {
        for(int l = 0; l <= add + A[i]; l++) nxt[j][k][l] = inf;
      }
    }
    for(int j = 0; j <= K; j++) {
      for(int k = 0; k <= K; k++) {
        int s = j < K ? max(0, A[i] - R[j]) : 0;
        int t = k < K ? max(0, A[i] - B[k]) : 0;
        for(int l = 0; l <= add; l++) {
          if(j < K) nxt[j + 1][k][l + A[i]] = min(nxt[j + 1][k][l + A[i]], cur[j][k][l] + s);
          if(k < K) nxt[j][k + 1][l] = min(nxt[j][k + 1][l], cur[j][k][l] + t);

        }
      }
    }
    add += A[i];
  }


  auto cur = dp;
  auto nxt = dp2;
  if(N % 2)swap(cur, nxt);

  int ret = inf;
  for(int i = 0; i <= K; i++) {
    for(int j = 0; j <= K; j++) {
      for(int k = 0; k <= add && k <= rs; k++) {
        int other = as - k;
        if(other <= bs) {
          chmin(ret, cur[i][j][k]);
        }
      }
    }
  }
  if(ret == inf) ret = -1;
  cout << ret << endl;
}




Measured memory_bytes: 90368