/// Containers Start
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include<random>
/// C Header Files
#include <cstdio>
#include <cctype>
#include <cmath>
#include <math.h>
#include <ctime>
#include <cstring>
/// Containers End


using namespace std;


/// Math Start
#define PI                    acos(-1.0)
#define Pi                    3.141592653589793
#define EPS (1e-7)
#define INF (0x3f3f3f3f)
/// Math End


/// Extra Start
#define nn                    '\n'
#define pb                    push_back
#define SS                    stringstream
#define ull                   unsigned long long
#define mod                   1000000007
#define SIZE                  2000001
#define _cin                  ios_base::sync_with_stdio(0);  cin.tie(0);
#define sz(a)                 int((a).size())
#define space                 " "
#define All(x)                (x).begin(), (x).end()
#define rall(x)               (x).rbegin(), (x).rend()
#define Ignore                cin.ignore()
#define StringToInt           if ( ! (istringstream(s) >> n) ) n = 0;
#define SORT(c) sort(All((c)))
#define RSORT(c) sort(rall((c)))
/// Extra End


/// Functions Start
template<class T>
T gcd(T a, T b) {
    if (b == 0)return a;
    return gcd(b, a % b);
}

long int gcd(long int a, long int b) {
    if (b == 0)return a;
    return gcd(b, a % b);
}

template<class T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }

template<class T>
string converter(T n) {
    SS x;
    x << n;
    return x.str();
}

#define rep(i, n) for(int i = 0;i < n;i++)
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define FORD(i, a, b) for(int i=(a);i>=(b);i--)
#define FORA(arr) for(auto &i:arr)
#define Cin(a)     cin >>a;
#define Cin2(a, b)        cin>>a>>b;
#define Cin3(a, b, c)        cin>>a>>b>>c;
#define Cin4(a, b, c, d)   cin>>a>>b>>c>>d;
#define Cini(a)        int a; cin>>a;
#define Cinii(a, b)        int a,b; cin>>a>>b;
#define Cins(s)         string s; cin >> s;
#define Cinc(c)         char c; cin >> c;
/// Functions End


/// Array Start
#define SET(a)                memset( a, -1,    sizeof a )
#define CLR(a)                memset( a,  0,    sizeof a )
#define MEM(a, val)            memset( a,  val,  sizeof a )
/// Array End


/// Debug Start
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl
#define deb3(x, y, z) cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z << end
/// Debug End


/// TypeDef Start
typedef long long int ll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<pii> vii;
/// TypeDef End

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

/**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/


///topcoder template

//
//int main(void) {
//    Cinii(n, c);
//    int d[c][c];
//    int a[n][n];
//    int min = INF;
//    int sum[c][c][c];
//    CLR(d);
//    CLR(a);
//    CLR(sum);
//    rep(i, c) rep(j, c) cin >> d[i][j];
//    rep(i, n) rep(j, n) cin >> a[i][j];
//    if(n==1) printf("0");
//    else if(n>=2){
//        rep(i,c) rep(j,c) rep(k,c){
//                    if(i==j or j==k or k==i) continue;
//                    for(int x = 1;x<=n;x++){
//                        for(int y=1;y<=n;y++){
//                            if((x+y)%3==2){
//                                sum[i][j][k] += d[a[x-1][y-1]-1][i];
//                            }else if((x+y)%3==0){
//                                sum[i][j][k] += d[a[x-1][y-1]-1][j];
//                            }else{
//                                sum[i][j][k] += d[a[x-1][y-1]-1][k];
//                            }
////                            deb(x);
////                            deb(y);
////                            deb(i);
////                            deb(j);
////                            deb(k);
////                            deb(a[x-1][y-1]);
////                            deb(d[a[x-1][y-1]][i]);
////                            deb(d[a[x-1][y-1]][j]);
////                            deb(d[a[x-1][y-1]][k]);
//                        }
//                    }
//
//                }
//
//        rep(i,c) rep(j,c) rep(k,c) if(i!=j and j!=k and k!=i) if(min > sum[i][j][k]){ min = sum[i][j][k]; }
//        printf("%d",min);
//    }
//    return  0;
//}



//int main(void) {
//    Cinii(a, b);
//    if (a <= 8 && b <= 8) { printf("Yay!"); }
//    else{ printf(":("); }
//
//    return 0;
//
//}


//
//int main(void){
//    Cinii(d,n);
//    (n<=99)? printf("%d",(int)(n*pow(100,d))) : printf("%d",(int)((n+1)*pow(100,d)));
//    return 0;
//}

//int main(void){
//    Cini(n);
//    int a[n];
//    rep(i,n) cin >> a[i];
//    int count = 0;
//    for(int i=0;i<n;i++){
//        while(a[i]%2==0){
//            count++;
//            a[i] /=2;
//        }
//    }
//    printf("%d",count);
//    return 0;
//}


int main(void) {
    Cinii(n, m);
    long x[n], y[n], z[n], max[2][2][2], tmax = 0;
    long double sum[2][2][2][n];
    rep(i, n) cin >> x[i] >> y[i] >> z[i];
    CLR(sum);
    CLR(max);

    rep(i, 2)rep(j, 2)rep(k, 2) {
                for (int ii = 0; ii < n; ii++) {
                    sum[i][j][k][ii] = pow(-1, i) * x[ii] + pow(-1, j) * y[ii] + pow(-1, k) * z[ii];
                }

                sort(sum[i][j][k], sum[i][j][k] + n, greater<long>());

                for (int ii = 0; ii < m; ii++) max[i][j][k] += sum[i][j][k][ii];
                if (tmax < max[i][j][k]) tmax = max[i][j][k];
            }
    printf("%ld\n", tmax);


    return 0;
}





Measured memory_bytes: 384