#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include<map>
using namespace std;
/*int pachet(vector<int>myvector1,vector<int> myvector2,int poz_vect1,int poz_vect2,int *sum1)
{
    int *sum2=0;
    int ok=0,i;
    for(i=poz_vect1; i<myvector1.size(); i++)

        sum1+=myvector1[i];

    for(int j=0; j<myvector2.size(); j++)
    {
        sum2+=myvector2[j];
        if(sum2==sum1) {break;ok=1;}
        else return pachet(myvector1,myvector2,i,j+1,sum1);
    }
    return ok;
}
int main()
{
    int a,b,c,x,sum1=0,sum2=0,sum3=0,k=0;
    char s;
    cin>>s>>a>>b>>c;
    vector<int>myvector1(a);
    vector<int>myvector2(b);
    vector<int>myvector3(c);
    vector<int>rezultat;
    if(s=='s')
    {
        while(a--)
        {
            cin>>x;
            myvector1.push_back(x);
        }
        while(b--)
        {
            cin>>x;
            myvector2.push_back(x);
        }
        while(c--)
        {
            cin>>x;
            myvector3.push_back(x);
        }
        int k=0,j=0;
        while(k!=myvector1.size())
        {
            if(pachet(myvector1,myvector2,k,j,&sum1)==0) j++;
            else cout<<sum1<<endl;
            if(j==b) k++;
        }

    }
    return 0;
}
*/
int f(vector<int>myvector)
{
    int s=0;
    for(int i=0;i<myvector.size();i++)
        s+=myvector[i];
    return s;
}
int main()
{
    int a,b,c,x,sum1=0,sum2=0,sum3=0,k=0;
    char s;
    int m=0;
    map<int,int>mymap;
    cin>>s>>a>>b>>c;
    vector<int>myvector1(a);
    vector<int>myvector2(b);
    vector<int>myvector3(c);
    vector<int>rezultat;
    if(s=='s')
    {
        while(a--)
        {
            cin>>x;
            myvector1.push_back(x);
        }
        while(b--)
        {
            cin>>x;
            myvector2.push_back(x);
        }
        while(c--)
        {
            cin>>x;
            myvector3.push_back(x);
        }
    while(myvector1.size())
    {mymap[f(myvector1)]++;
        myvector1.erase(myvector1.begin());}
    while(myvector2.size())
    {mymap[f(myvector2)]++;
        myvector2.erase(myvector2.begin());}
    while(myvector3.size())
    {mymap[f(myvector3)]++;
        myvector3.erase(myvector3.begin());}


    /*for(int k=0;k!=myvector1.size();k++)
        mymap[f(myvector1,k)]++;
    for(int j=0;j!=myvector2.size();j++)
        mymap[f(myvector2,j)]++;
    for(int i=0;i!=myvector3.size();i++)
        mymap[f(myvector3,i)]++;
    */
     for(auto it=mymap.begin();it!=mymap.end();it++)
        cout<<"suma este "<<it->first<<" si apare de "<<it->second<<" ori"<<endl;

    for(auto it=mymap.begin();it!=mymap.end();it++)
        if(it->second>=3) rezultat.push_back(it->first);
    int max = *max_element(rezultat.begin(), rezultat.end());
    cout<<max<<endl;
    }
    return 0;
}