void main() {
  problem();
}

void problem() {
  const X = scan!int;
  const Y = scan!int;
  const A = scan!int;
  const B = scan!int;
  const C = scan!int;
  const P = scan!long(A).sort!"a > b".array;
  const Q = scan!long(B).sort!"a > b".array;
  const R = scan!long(C).sort!"a > b".array;
  
  deb([X, Y, A, B, C]);
  deb(P);deb(Q);deb(R);

  long solve() {
    const replacable = (X + Y <= C ? X + Y : C) - 1;
    auto red_border = X - 1;
    auto green_border = Y - 1;

    auto red_sum = P[0..X].sum;
    auto green_sum = Q[0..Y].sum;

    alias DP = Tuple!(long, "points", int, "red_border", int, "green_border", int, "plain_border", bool, "extended");
    DP[long][long] dp;
    dp[0][0] = DP(red_sum + green_sum, red_border, green_border, 0, false);

    foreach(_; 0..10) {
      foreach(green; dp.keys) {
        foreach(red; dp[green].keys) {
          auto cur = dp[green][red];
          if (cur.extended) continue;
          if (cur.plain_border > replacable) continue;

          const r = R[cur.plain_border];
          if (cur.red_border < X && r > P[cur.red_border]) {
            const newDp = DP(
              cur.points + r - P[cur.red_border],
              cur.red_border + 1,
              cur.green_border,
              cur.plain_border + 1,
              false
            );
            dp[green][red+r] = newDp;
          }
          if (cur.green_border < Y && r > Q[cur.green_border]) {
            const newDp = DP(
              cur.points + r - Q[cur.green_border],
              cur.red_border,
              cur.green_border + 1,
              cur.plain_border + 1,
              false
            );
            dp[green+r][red] = newDp;
          }
          cur.extended = true;
        }
      }
    }
    
    long max;
    foreach(x; dp.keys) foreach(p; dp[x].values) if (max < p.points) max = p.points;

    return max;
  }

  solve().writeln;
}

// ----------------------------------------------

import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; }
T[] scan(T)(int n){ return n.iota.map!(i => scan!T()).array; }
void deb(T ...)(T t){ debug writeln(t); }
alias Point = Tuple!(long, "x", long, "y");

// -----------------------------------------------
