ktlon

#include <bits/stdc++.h>

using namespace std;
ifstream fin("ktlon.in");
ofstream fout("ktlon.out");

int C, n, m, K, F[10005], R[10005];
int Fmax, Rmax, sol1;
int sF, sR;
int main()
{
    fin>>C;
    if(C==1)
    {
        fin>>n>>K;
        for(int k=1; k<=K; ++k)
        {
            Fmax=Rmax=0;
            for(int i=1; i<=n; ++i)
            {
                fin>>F[i];
                if(F[i]>Fmax)
                    Fmax=F[i];
            }
            for(int i=1; i<=n; ++i)
            {
                fin>>R[i];
                if(R[i]>Rmax)
                    Rmax=R[i];
            }
            if(Rmax > Fmax)
                sol1++;
        }
        fout<<sol1;
        return 0;
    }
    fin>>n>>K;
    for(int k=1; k<=K; ++k)
    {
        for(int i=1; i<=n; ++i)
            fin>>F[i];
        for(int i=1; i<=n; ++i)
            fin>>R[i];
        sort(F+1, F+1+n, greater<int>());
        sort(R+1, R+1+n, greater<int>());
        int Fm=0, Rm=0;
        int im=1, ir=1, ok=0;
        while(im<=min(n,5) && F[im]>R[1])
        {
            Fm+=F[im];
            Rm+=R[im];
            im++;ok=1;
        }
        if(ok)
        {
            sF+=(Fm - Rm);
        }
        else
        {
            while(ir<=min(n,5) && R[ir]>F[1])
            {
                Fm+=F[ir];
                Rm+=R[ir];
                ir++;ok=1;
            }
            sR+=(Rm - Fm);
        }
    }
    if(sF > sR)
        fout<<sF;
    else if (sF==sR)
        fout<<0;
    else
        fout<<sR;
    return 0;
}