#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL,LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL, vector<LL>, greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define FOR(i,a,n) for(i=a;i<n;i++)
#define rep(i,n) FOR(i,0,n)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a,n) *upper_bound(ALL(a),n)
#define LB(a,n) *lower_bound(ALL(a),n)
#define INF 1145141919810364364
#define PI 3.14159265358979
//#define MOD 1000000007
#define MOD 998244353
#define ERR 0.00000000000001
#define NUM 200010

void Yn(LL a){if(a)printf("Yes\n");else printf("No\n");}
void YN(LL a){if(a)printf("YES\n");else printf("NO\n");}
LL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}
LL GCD(LL a,LL b){LL c=1,tmp=max(a,b);b=min(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}
LL LCM(LL a,LL b){return a*b/GCD(a,b);}
LL mod(LL a,LL m){if(a<0)return a%m+m;else return a%m;}
LL DIV(LL a,LL d){LL m=MOD,x=1,y=0,k;while(m){k=d/m;d-=k*m;swap(m,d);x-=k*y;swap(x,y);}return mod(a*mod(x,MOD),MOD);}
LL FAC(LL a){LL i,ans=1;FOR(i,1,a+1){ans*=i;if(MOD>0&&ans>MOD)ans%=MOD;}return ans;}
LL POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return ans;}
LL fact[NUM],finv[NUM],inv[NUM];
void comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}
LL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
bool cmps(pair<LL,LL> a,pair<LL,LL> b){if(a.second!=b.second)return a.second<b.second;return a.first<b.first;}

LL pid1=0,pnum1=0,rpid1[NUM];LL cpid1[NUM],que1[NUM];
LL judge1(LL a,LL b){if(pnum1<b||b==1)return 0;return cpid1[que1[a]]>cpid1[que1[b]]?1:0;}
void push1(LL a,LL n){LL i=++pid1,j=++pnum1;rpid1[i]=n,cpid1[i]=a,que1[j]=i;while(judge1(j/2,j))que1[j]=que1[j/2],que1[j/=2]=i;}
LL pop1(){LL ans=rpid1[que1[1]],i=1,j;LL n=que1[pnum1--];que1[1]=n;while(judge1(i,j=i*2+judge1(i*2,i*2+1)))que1[i]=que1[j],que1[i=j]=n;return ans;}
LL pid2=0,pnum2=0,rpid2[NUM];LL cpid2[NUM],que2[NUM];
LL judge2(LL a,LL b){if(pnum2<b||b==1)return 0;return cpid2[que2[a]]>cpid2[que2[b]]?1:0;}
void push2(LL a,LL n){LL i=++pid2,j=++pnum2;rpid2[i]=n,cpid2[i]=a,que2[j]=i;while(judge2(j/2,j))que2[j]=que2[j/2],que2[j/=2]=i;}
LL pop2(){LL ans=rpid2[que2[1]],i=1,j;LL n=que2[pnum2--];que2[1]=n;while(judge2(i,j=i*2+judge2(i*2,i*2+1)))que2[i]=que2[j],que2[i=j]=n;return ans;}

int main(){
  LL i,ans=0,X,Y,A,B,C,pa,pb;
  cin>>X>>Y>>A>>B>>C;
  VL p(A),q(B),r(C);
  PQS a,b;
  rep(i,A)cin>>p[i];
  rep(i,B)cin>>q[i];
  rep(i,C)cin>>r[i];
  SORT(p);SORT(q);SORT(r);
  REV(p);REV(q);REV(r);
  rep(i,X){
    push1(p[i],p[i]);
    ans+=p[i];
  }
  rep(i,Y){
    push2(q[i],q[i]);
    ans+=q[i];
  }
  rep(i,C){
    pa=pop1();pb=pop2();
    if(pa<=pb&&pa<=r[i]){
      ans-=pa;
      ans+=r[i];
      push1(r[i],r[i]);
      push2(pb,pb);
    }else if(pb<=pa&&pb<=r[i]){
      ans-=pb;
      ans+=r[i];
      push2(r[i],r[i]);
      push1(pa,pa);
    }else break;
  }

  cout<<ans<<endl;
}


Measured memory_bytes: 11904