#include <fstream>
#include <algorithm>

using namespace std;

#define ull unsigned long long
#define ll long long

#define inf "input.txt"
#define outf "output.txt"

#define infile "jeton.in"
#define outfile "jeton.out"



int main()
{

    ifstream fin(infile);
    ofstream fout(outfile);

     int n, m;
    fin >> n >> m;

    int x[28001], y[28001];

    for (int i = 1; i <= n; i++)
        fin >> x[i];

    for (int j = 1; j <= m; j++)
        fin >> y[j];

    int gyakorisag[60000] = { 0 };

    for (int i = 1; i <= n; i++)
        gyakorisag[x[i]]++;
    for (int i = 1; i <= m; i++)
        gyakorisag[y[i]]++;

    int minelem, maxelem;

    for (int i = 1; i <= 60000; i++)
        if (gyakorisag[i] == 2)
        {
            minelem = i;
            break;
        }

    for (int i = 60000; i >= 1; i--)
        if (gyakorisag[i] == 2)
        {
            maxelem = i;
            break;
        }
    fout << minelem << " " << maxelem<< " ";

    for (int i = 1; i <= n; i++)
        if (x[i] >= minelem && x[i] <= maxelem)
            x[i] = 0;

    for (int i = 1; i <= m; i++)
        if (y[i] >= minelem && y[i] <= maxelem)
            y[i] = 0;


    ull ionel = 0;
    for (int i = 1; i <= n; i++)
        if (x[i] > 0)
            ionel++;


    ull georgel = 0;
    for (int i = 1; i <= m; i++)
        if(y[i]>0)
            georgel++;

    if (ionel > georgel)
        fout << 1;
    else if (ionel < georgel)
        fout << 2;
    else
        fout << 0;


	return 0;
}