//file_name:ABC100_B.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

    // 整数スキャン（複数）
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&y);

    // n個の整数のスキャン
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // 文字列スキャン
    /*
    string s;
    cin >> s;
    */


int main() {
    int n;
    scanf("%d",&n);
    int m;
    scanf("%d",&m);
    ll x[n][3] = {};
    rep(i,n){
        rep(l,3){
            scanf("%lld",&x[i][l]);
        }
    }
    ll dp[n][m+1][8][3];
    
    rep(i,n){
        rep(j,m+1){
            rep(k,8){
                if(i==0&&j==1){
                    rep(l,3){
                        dp[i][j][k][l] = x[i][l];
                    }
                }else if(j==0||i==0){
                    rep(l,3){
                        dp[i][j][k][l] = 0;
                    }
                }else if(i+1==j){
                    rep(l,3){
                        dp[i][j][k][l] = dp[i-1][j-1][k][l] + x[i][l];
                    }
                }else{
                    ll temp1[3] = {};
                    ll temp2[3] = {};
                    ll max = 0;
                    rep(l,3){
                        temp1[l] = dp[i-1][j][k][l];
                        temp2[l] = dp[i-1][j-1][k][l] + x[i][l];
                    }
                    if(k<4){
                        max += temp1[0] - temp2[0];
                    }else{
                        max += temp2[0] - temp1[0];
                    }
                    if(k%4<2){
                        max += temp1[1] - temp2[1];
                    }else{
                        max += temp2[1] - temp1[1];
                    }
                    if(k%2<1){
                        max += temp1[2] - temp2[2];
                    }else{
                        max += temp2[2] - temp1[2];
                    }
                    rep(l,3){
                        if(max>0){
                            dp[i][j][k][l] = temp1[l];
                        }else{
                            dp[i][j][k][l] = temp2[l];
                        }
                    }
                }
            }
        }
    }


    ll ans = 0;
    rep(k,8){
        ll max =0;
        if(k<4){
            max += dp[n-1][m][k][0];
        }else{
            max -= dp[n-1][m][k][0];
        }
        if(k%4<2){
            max += dp[n-1][m][k][1];
        }else{
            max -= dp[n-1][m][k][1];
        }
        if(k%2<1){
            max += dp[n-1][m][k][2];
        }else{
            max -= dp[n-1][m][k][2];
        }
        if(ans<max){
            ans = max;
            //cout << k << endl;
        }
    }
    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 187904