#include <bits/stdc++.h>
 
using namespace std;
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif


typedef long long ll; 
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
 
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()

const int maxN = 2002;
const int INF = (int)1e9;

int n, x, y;
int res[maxN];
vector<int> a[maxN];

vector<int> bfs(int v) {
  queue<int> q;
  q.push(v);
  vector<bool> visited(n, false);
  vector<int> dist(n, INF);
  dist[v] = 0;
  visited[v] = true;
  while (!q.empty()) {
    v = q.front(); q.pop();
    for (int i = 0 ; i < a[v].size() ; i++) {
      int u = a[v][i];
      if (!visited[u]) {
        visited[u] = true;
        dist[u] = dist[v] + 1;
        q.push(u);
      }
    }
  }
  return dist;
}

void solve() {
  int x, y, a, b, c;
  cin >> x >> y >> a >> b >> c;
  vector<int> p(a), q(b), r(c);
  for (int i = 0 ; i < a ; i++) {
    cin >> p[i];
  }
  for (int i = 0 ; i < b ; i++) {
    cin >> q[i];
  }
  for (int i = 0 ; i < c ; i++) {
    cin >> r[i];
  }
  sort(all(p)); reverse(all(p));
  sort(all(q)); reverse(all(q));
  sort(all(r)); reverse(all(r));
  ll sum = 0;
  for (int i = 0 ; i < x ; i++) {
    sum += (ll)p[i];
  }
  for (int i = 0 ; i < y ; i++) {
    sum += (ll)q[i];
  }
  int i = x - 1, j = y - 1, k = 0;
  while (i >= 0 && j >= 0 && k < c) {
    if (min(p[i], q[j]) < r[k]) {
      if (p[i] < q[j]) {
        sum -= (ll)p[i--];
        sum += (ll)r[k++];
      } else {
        sum -= (ll)q[j--];
        sum += (ll)r[k++];
      }
    } else break;
  }
  while (i >= 0 && k < c && p[i] < r[k]) {
    sum -= (ll)p[i--];
    sum += (ll)r[k++];
  }
  while (j >= 0 && k < c && q[j] < r[k]) {
    sum -= (ll)q[j--];
    sum += (ll)r[k++];
  }
  cout << sum;
}
 
int main() {
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
 
  return 0;
}

Measured memory_bytes: 1536