import java.io.*;
import java.util.*;

class Solver {
  final int x, y, a, b, c;
  final int[] ps, qs, rs;

  Solver(int x, int y, int a, int b, int c, int[] ps, int[] qs, int[] rs) {
    this.x = x;
    this.y = y;
    this.a = a;
    this.b = b;
    this.c = c;
    this.ps = ps;
    this.qs = qs;
    this.rs = rs;
  }

  public long solve() {
    Comparator<Integer> largeFirstComparator = new Comparator<Integer>(){
      public int compare(Integer i1, Integer i2) {
        return i2 - i1;
      }
    };

    Arrays.sort(ps);
    Arrays.sort(qs);
    PriorityQueue<Integer> queue1 = new PriorityQueue<>(largeFirstComparator);
    for (int i = 0; i < x; i++) {
      queue1.add(ps[a - 1 - i]);
    }
    for (int i = 0; i < y; i++) {
      queue1.add(qs[b - 1 - i]);
    }
    PriorityQueue<Integer> queue2 = new PriorityQueue<>(largeFirstComparator);
    for (int r : rs) {
      queue2.add(r);
    }

    long answer = 0;
    for (int i = 0; i < x + y; i++) {
      int v1 = queue1.isEmpty() ? -1 : queue1.peek();
      int v2 = queue2.isEmpty() ? -1 : queue2.peek();
      if (v1 > v2) {
        answer += queue1.poll();
      } else {
        answer += queue2.poll();
      }
    }
    return answer;

    /*
    PriorityQueue<Integer> pQueue = new PriorityQueue<>();
    for (int p : ps) {
      pQueue.add(p);
    }
    while (pQueue.size() > x) {
      pQueue.poll();
    }
    PriorityQueue<Integer> qQueue = new PriorityQueue<>();
    for (int q : qs) {
      qQueue.add(q);
    }
    while (qQueue.size() > y) {
      qQueue.poll();
    }
    PriorityQueue<Integer> rQueue = new PriorityQueue<Integer>(new Comparator<Integer>(){
      public int compare(Integer i1, Integer i2) {
        return i2 - i1;
      }
    });
    for (int r : rs) {
      rQueue.add(r);
    }

    long answer = 0;
    while (!rQueue.isEmpty()) {
      int r = rQueue.poll();
      int pValue = pQueue.isEmpty() ? Integer.MAX_VALUE : pQueue.peek();
      int qValue = qQueue.isEmpty() ? Integer.MAX_VALUE : qQueue.peek();
      if (pValue < qValue && pValue < r) {
        pQueue.poll();
        answer += r;
      } else if (qValue < pValue && qValue < r) {
        qQueue.poll();
        answer += r;
      }
    }
    while (!pQueue.isEmpty()) {
      answer += pQueue.poll();
    }    
    while (!qQueue.isEmpty()) {
      answer += qQueue.poll();
    }    

    return answer;
    */
  }
}

public class Main {

  private static void execute(ContestReader reader, ContestWriter out) {
    int x = reader.nextInt();
    int y = reader.nextInt();
    int a = reader.nextInt();
    int b = reader.nextInt();
    int c = reader.nextInt();
    int[] ps = reader.nextInt(a);
    int[] qs = reader.nextInt(b);
    int[] rs = reader.nextInt(c);
    out.println(new Solver(x, y, a, b, c, ps, qs, rs).solve());
  }
  
  public static void main(String[] args) {
    ContestReader reader = new ContestReader(System.in);
    ContestWriter out = new ContestWriter(System.out);
    execute(reader, out);
    out.flush();
  }
}

class ContestWriter extends PrintWriter {
  ContestWriter(PrintStream printeStream) {
    super(printeStream);
  }

  public void printList(List list) {
    for (Object object : list) {
      println(object);
    }
  }

  public void printListOneLine(List list) {
    List<String> stringList = new ArrayList<>();
    for (Object object : list) {
      stringList.add(object.toString());
    }
    println(String.join(" ", stringList));
  }
}

class ContestReader {
  private static final int BUFFER_SIZE = 1024;
  
  private final InputStream stream;
  private final byte[] buffer;
  private int pointer;
  private int bufferLength;
  
  ContestReader(InputStream stream) {
    this.stream = stream;
    this.buffer = new byte[BUFFER_SIZE];
    this.pointer = 0;
    this.bufferLength = 0;
  }
  
  private boolean hasNextByte() {
    if (pointer < bufferLength) {
      return true;
    }
    
    pointer = 0;
    try {
      bufferLength = stream.read(buffer);
    } catch (IOException e) {
      throw new RuntimeException(e);
    }
    return bufferLength > 0;
  }
  
  private int readByte() {
    if (hasNextByte()) {
      return buffer[pointer++];
    } else {
      return -1;
    }
  }
  
  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }
  
  public boolean hasNext() {
    while (hasNextByte() && !isPrintableChar(buffer[pointer])) {
      pointer++;
    }
    return hasNextByte();
  }
  
  public String next() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    StringBuilder sb = new StringBuilder();
    while(true) {
      int b = readByte();
      if (!isPrintableChar(b)) {
        break;
      }
      sb.appendCodePoint(b);
    }
    return sb.toString();
  }
  
  public String nextLine() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    StringBuilder sb = new StringBuilder();
    while(true) {
      int b = readByte();
      if (!isPrintableChar(b) && b != 0x20) {
        break;
      }
      sb.appendCodePoint(b);
    }
    return sb.toString();
  }
  
  public char nextChar() {
    return next().charAt(0);
  }
  
  public int nextInt() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    
    int n = 0;
    boolean minus = false;
    
    {
      int b = readByte();
      if (b == '-') {
        minus = true;
      } else if ('0' <= b && b <= '9') {
        n = b - '0';
      } else {
        throw new NumberFormatException();
      }
    }
    
    while(true){
      int b = readByte();
      if ('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if (b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
    }
  }
  
  public long nextLong() {
    if (!hasNext()) {
      throw new NoSuchElementException();
    }
    
    long n = 0;
    boolean minus = false;
    
    {
      int b = readByte();
      if (b == '-') {
        minus = true;
      } else if ('0' <= b && b <= '9') {
        n = b - '0';
      } else {
        throw new NumberFormatException();
      }
    }
    
    while(true){
      int b = readByte();
      if ('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if (b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
    }
  }
  
  public double nextDouble() {
    return Double.parseDouble(next());
  }
  
  public String[] next(int n) {
    String[] array = new String[n];
    for (int i = 0; i < n; i++) {
      array[i] = next();
    }
    return array;
  }
  
  public String[] nextLine(int n) {
    String[] array = new String[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextLine();
    }
    return array;
  }
  
  public char[] nextChar(int n) {
    char[] array = new char[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextChar();
    }
    return array;
  }
  
  public int[] nextInt(int n) {
    int[] array = new int[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextInt();
    }
    return array;
  }
  
  public long[] nextLong(int n) {
    long[] array = new long[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextLong();
    }
    return array;
  }
  
  public double[] nextDouble(int n) {
    double[] array = new double[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextDouble();
    }
    return array;
  }
  
  public char[] nextCharArray() {
    return next().toCharArray();
  }
  
  public String[][] next(int n, int m) {
    String[][] matrix = new String[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = next();
      }
    }
    return matrix;
  }
  
  public int[][] nextInt(int n, int m) {
    int[][] matrix = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextInt();
      }
    }
    return matrix;
  }
  
  public char[][] nextChar(int n, int m) {
    char[][] matrix = new char[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextChar();
      }
    }
    return matrix;
  }
  
  public long[][] nextLong(int n, int m) {
    long[][] matrix = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextLong();
      }
    }
    return matrix;
  }
  
  public double[][] nextDouble(int n, int m) {
    double[][] matrix = new double[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextDouble();
      }
    }
    return matrix;
  }
  
  public char[][] nextCharArray(int n) {
    char[][] matrix = new char[n][];
    for (int i = 0; i < n; i++) {
      matrix[i] = next().toCharArray();
    }
    return matrix;
  }
}


Measured memory_bytes: 49328