#include<fstream>
using namespace std;
int v[20][20],semn[20],n,m,best=0,s=0;
ifstream in("flip.in");
ofstream out("flip.out");

int citire()
{
    in>>n>>m;
    int i,j;
    for(i = 1 ; i <= n ; i++)
        for(j = 1 ; j <= n; j++)
            in>>v[i][j];
    in.close();
}

int max(int a,int b)
{

    if(a>=b) return a;
    else return b;
}

void solve()
{

    int i,j,s1=0;
    for( i = 1 ; i <= n ; i++)
    {
        s = 0;
        for( j = 1 ; j <= n; j++)
            s+=v[i][j] * semn[j];
        s1+=max(s,-s);
    }
    if(best < s1) best = s1;
}

void back(int k)
{

    if(k == m+1) solve();
    else{
        semn[k] = -1;
        back(k+1);
        semn[k] = 1;
        back(k+1);
    }
}

int main()
{

    citire();
    back(1);
    out<<best;
    out.close();
    return 0;
}