import java.util.Scanner

fun main(args: Array<String>) {
	val scn = Scanner(System.`in`)
	val x = scn.nextInt()
	val y = scn.nextInt()
	val a = scn.nextInt()
	val b = scn.nextInt()
	val c = scn.nextInt()
	val ps = LongArray(a){scn.nextLong()}.sortedDescending()
	val qs = LongArray(b){scn.nextLong()}.sortedDescending()
	val rs = LongArray(c){scn.nextLong()}.sortedDescending()
	var ip = x-1
	var iq = y-1
	var sum = ps.subList(0,x).sum() + qs.subList(0,y).sum()
	for (ir in 0 until c.coerceAtMost(x+y)){
		val r = rs[ir]
		if (ip<0){
			val q = qs[iq]
			if (q>=r) break
			iq--
			sum += r-q
		}else if(iq<0){
			val p = ps[ip]
			if (p>=r) break
			ip--
			sum += r-p
		}else {
			val p = ps[ip]
			val q = qs[iq]
			if (p<=q && p<r){
				ip--
				sum += r-p
			}else if (q<p && q<r){
				iq--
				sum += r-q
			}else break
		}

	}
	println(sum)

}