#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define double long double
using namespace std;
constexpr int N=1e6+10;
constexpr int mod=998244353;
void solve()
{
    int a,b,c,d;
    cin >> a >> b >> c >> d;
    int ans=0;
    priority_queue<int> pq;
    int l=0,r=0;
    for(int i=0;i<a;i++)
    {
        int num;
        cin >> num;
        pq.push(num);
    }
    while(!pq.empty())
    {
        if(l>r)
        {
            r+=pq.top();
        }else l+=pq.top();
        pq.pop();
    }
    ans+=max(l,r);
    l=0,r=0;
    for(int i=0;i<b;i++)
    {
        int num;
        cin >> num;
        pq.push(num);
    }
    while(!pq.empty())
    {
        if(l>r)
        {
            r+=pq.top();
        }else l+=pq.top();
        pq.pop();
    }
    ans+=max(l,r);
    // cout << ans << endl;
    l=0,r=0;
    for(int i=0;i<c;i++)
    {
        int num;
        cin >> num;
        pq.push(num);
    }
    while(!pq.empty())
    {
        if(l>r)
        {
            r+=pq.top();
        }else l+=pq.top();
        pq.pop();
    }
    ans+=max(l,r);
    l=0,r=0;
    for(int i=0;i<d;i++)
    {
        int num;
        cin >> num;
        pq.push(num);
    }
    while(!pq.empty())
    {
        if(l>r)
        {
            r+=pq.top();
        }else l+=pq.top();
        pq.pop();
    }
    ans+=max(l,r);
    cout << ans;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    // int o;
    // cin >> o;
    // while(o--)
    solve();
    return 0;
}
//
//⠀⠀⠀             ⠀⢸⣿⣿⣿⠀⣼⣿⣿⣦⡀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠀ ⠀⢸⣿⣿⡟⢰⣿⣿⣿⠟⠁
//⠀⠀⠀⠀⠀⠀⠀⢰⣿⠿⢿⣦⣀⠀⠘⠛⠛⠃⠸⠿⠟⣫⣴⣶⣾⡆
//⠀⠀⠀⠀⠀⠀⠀⠸⣿⡀⠀⠉⢿⣦⡀⠀⠀⠀⠀⠀⠀ ⠛⠿⠿⣿⠃
//⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣦⠀⠀⠹⣿⣶⡾⠛⠛⢷⣦⣄⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣧⠀⠀⠈⠉⣀⡀⠀ ⠀⠙⢿⡇
//⠀⠀⠀⠀⠀⠀⢀⣠⣴⡿⠟⠋⠀⠀⢠⣾⠟⠃⠀⠀⠀⢸⣿⡆
//⠀⠀⠀⢀⣠⣶⡿⠛⠉⠀⠀⠀⠀⠀⣾⡇⠀⠀⠀⠀⠀⢸⣿⠇
//⢀⣠⣾⠿⠛⠁⠀⠀⠀⠀⠀⠀⠀⢀⣼⣧⣀⠀⠀⠀⢀⣼⠇
//⠈⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⡿⠋⠙⠛⠛⠛⠛⠛⠁
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣾⡿⠋⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⢾⠿⠋⠀
//