#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
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;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail
{
  template <typename T, std::size_t NDIMS>
  struct vector_builder
  {
    using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
      if (!dims.empty())
        dims.pop_back();
      return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
    }
  };

  template <typename T>
  struct vector_builder<T, 1>
  {
    using type = std::vector<T>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      return type(dims.empty() ? 0 : dims.back(), v);
    }
  };
} // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T &v, SIZE_T... dims)
{
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T &data, vector<int> &iter)
{
  cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
  for (auto elem : data)
    dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
  for (auto elem : iter)
  {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++)
  {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T> &data, int dummy)
{
  for (int i = 0; i < data.size(); i++)
  {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

void solve(long long X, long long Y, long long A, long long B, long long C, std::vector<long long> p, std::vector<long long> q, std::vector<long long> r)
{

  sort(p.begin(), p.end());
  sort(q.begin(), q.end());
  sort(r.begin(), r.end());
  reverse(p.begin(), p.end());
  reverse(q.begin(), q.end());
  reverse(r.begin(), r.end());
  vector<LL> P = {0}, Q = {0}, R = {0};
  LL sum = 0;
  for (auto elem : p)
  {
    sum += elem;
    P.push_back(sum);
  }
  sum = 0;

  for (auto elem : q)
  {
    sum += elem;
    Q.push_back(sum);
  }
  sum = 0;
  for (auto elem : r)
  {
    sum += elem;
    R.push_back(sum);
  }

  auto innerC = [&](int x, int y) {
    if (x < 0)
      return 0LL;
    if (y < 0)
      return 0LL;
    if (x >= P.size())
      return 0LL;
    if (y >= Q.size())
      return 0LL;
    if (X < x || Y < y)
      return 0LL;

    LL ret = 0;
    ret += P[x];
    ret += Q[y];
    int remain = min(C, X + Y - x - y);
    ret += R[remain];
    //cout << x << " " << y << " " << ret << endl;
    return ret;
  };

  auto search = [&](PII cur) {
    int x = cur.first;
    int y = cur.second;
    PII next = cur;
    LL best = innerC(cur.first, cur.second);
    vector<PII> cand = {
        PII(x - 1, y),
        PII(x + 1, y),
        PII(x, y - 1),
        PII(x, y + 1),

        PII(x - 1, y - 1),
        PII(x + 1, y - 1),
        PII(x - 1, y + 1),
        PII(x + 1, y + 1)};
    for (auto elem : cand)
    {
      LL score = innerC(elem.first, elem.second);
      if (score > best)
      {
        score = best;
        next = elem;
      }
    }

    return next;
  };

  PII cur = PII(0, 0);
  while (true)
  {
    PII next = search(cur);
    if (cur == next)
      break;
    cur = next;
  }

  LL ans = innerC(cur.first, cur.second);
  cout << ans << endl;

  /*
  auto innerB = [&](int x) {
    LL left = 0;
    LL right = min(Y, (LL)Q.size()) + 1;

    while (right - left > 1)
    {
      LL med1 = (2 * left + right) / 3;
      LL med2 = (2 * right + left) / 3;
      if (left == med1)
        med1++;

      LL val1 = innerC(x, med1);
      LL val2 = innerC(x, med2);
      if (val1 > val2)
      {
        right = med2;
      }
      else
        left = med1;
    }

    return innerC(x, left);
  };

  auto innerA = [&]() {
    LL left = 0;
    LL right = min(X, (LL)P.size()) + 1;

    while (right - left > 1)
    {
      //cout << " " << left << " " << right << endl;
      LL med1 = (2 * left + right) / 3;
      LL med2 = (2 * right + left) / 3;
      if (left == med1)
        med1++;

      LL val1 = innerB(med1);
      LL val2 = innerB(med2);
      if (val1 > val2)
      {
        right = med2;
      }
      else
        left = med1;
    }

    return innerB(left);
  };

  LL ans = innerA();
  cout << ans << endl;
  */
}

int main()
{
  cout << setprecision(10);
  long long X;
  scanf("%lld", &X);
  long long Y;
  scanf("%lld", &Y);
  long long A;
  scanf("%lld", &A);
  long long B;
  scanf("%lld", &B);
  long long C;
  scanf("%lld", &C);
  std::vector<long long> p(A);
  for (int i = 0; i < A; i++)
  {
    scanf("%lld", &p[i]);
  }
  std::vector<long long> q(B);
  for (int i = 0; i < B; i++)
  {
    scanf("%lld", &q[i]);
  }
  std::vector<long long> r(C);
  for (int i = 0; i < C; i++)
  {
    scanf("%lld", &r[i]);
  }
  solve(X, Y, A, B, C, std::move(p), std::move(q), std::move(r));
  return 0;
}


Measured memory_bytes: 8756