#include <bits/stdc++.h>
using namespace std;

int find_max(int sum[])
{
    int check = 1;
    if (sum[2] > sum[check]) check = 2;
    if (sum[3] > sum[check]) check = 3;
    return check;
}

int main()
{
    queue<int> num[4];
    int sum[4] = {0, 0, 0, 0};

    int n[4];
    cin >> n[1] >> n[2] >> n[3];

    for (int i = 1; i <= 3; i++)
    {
        for (int j = 1; j <= n[i]; j++)
        {
            int temp;
            cin >> temp;
            sum[i] += temp;
            num[i].push(temp);
        }
    }

    while (!(sum[1] == sum[2] && sum[2] == sum[3]))
    {
        int temp = find_max(sum);
        sum[temp] -= num[temp].front();
        num[temp].pop();
    }

    cout << sum[1];
}