import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
import std.math;
import std.array;

void main() {
  int x, y, a, b, c;
  readf("%d %d %d %d %d\n", &x, &y, &a, &b, &c);
  auto p = readln.chomp.split.map!(to!int).array.sort().array;
  auto q = readln.chomp.split.map!(to!int).array.sort().array;
  auto r = readln.chomp.split.map!(to!int).array.sort().array;

  int[] red = p[$-x..$];
  int[] green = q[$-y..$];

  int i=0, j=0, k=0;
  while((i<x || j<y) && k<c) {
    if(i<x && j<y) {
      if(red[i] < green[j]) {
        if(red[i] < r[$-k-1]) {
          red[i] = r[$-k-1];
          i++; k++;
        }
        else break;
      }
      else {
        if(green[j] < r[$-k-1]) {
          green[j] = r[$-k-1];
          j++; k++;
        }
        else break;
      }
    }
    else if(i<x) {
      if(red[i] < r[$-k-1]) {
        red[i] = r[$-k-1];
        i++; k++;
      }
      else break;
    }
    else {
      if(green[j] < r[$-k-1]) {
        green[j] = r[$-k-1];
        j++; k++;
      }
      else break;
    }
  }
  long sum = 0;
  foreach(rd; red) sum+=rd;
  foreach(gn; green) sum+=gn;
  writeln(sum);
}
