#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

void read_arr(vector<int>& a) {
  for (int i = 0; i < a.size(); ++i) {
    scanf("%d", &a[i]);
  }
}

int main() {
  int X, Y;
  scanf("%d%d", &X, &Y);
  int lenA, lenB, lenC;
  scanf("%d%d%d", &lenA, &lenB, &lenC);
  vector<int> a(lenA), b(lenB), c(lenC);
  read_arr(a);
  read_arr(b);
  read_arr(c);
  sort(a.begin(), a.end(), greater<int>());
  a.resize(X);
  sort(b.begin(), b.end(), greater<int>());
  b.resize(Y);
  sort(c.begin(), c.end(), greater<int>());
  multiset<int> A(a.begin(), a.end());
  multiset<int> B(b.begin(), b.end());
  for (auto& x : c) {
    auto u = A.begin();
    auto v = B.begin();
    if (x < *u && x < *v) break;
    if (*u < *v) {
      A.erase(u);
      A.insert(x);
    } else {
      B.erase(v);
      B.insert(x);
    }
  }
  int64 ret = 0;
  for (auto& x : A) ret += x;
  for (auto& x : B) ret += x;
  printf("%lld\n", ret);
  return 0;
}


Measured memory_bytes: 9856