#include <bits/stdc++.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef map<int,int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQI; //大きい順
typedef priority_queue<int, VI, greater<int>> PQGI;
typedef priority_queue<PII> PQP; 
typedef priority_queue<PII, VPII, greater<int>> PQGP;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
#define FI first
#define SE second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define FORR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REPR(i,n) FORR(i,0,n)
#define BREP(bit,N) for (int bit = 0; bit < (1<<N); ++bit)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL INF = INT_MAX;
const LL LINF = LLONG_MAX;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;

//other
//-------------------------------------------
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define SEP(a) cout << fixed << setprecision(a)
#define COUT(x) cout << (x) << endl
#define ENDL cout << endl
#define SPACE cout << " "

VI dx = {1,0,-1,0,1,1,-1,-1};
VI dy = {0,1,0,-1,1,-1,1,-1};
VC dc = {'R','D','L','U'};
VS ds = {"R","D","L","U","RD","RU","LD","LU"};

LL Gcd(LL a, LL b) {
  return __gcd(a,b);
}

LL Lcm(LL a, LL b) {
  LL abd = Gcd(a,b);
  LL x = a / abd, y = b;
  return x*y;
}

LL ModPow(LL A, LL N, LL M){
  LL res = 1;
  while(N>0){
    if(N&1) res = res * A % M;
    A = A * A % M;
    N >>= 1;
  }
  return res;
}

LL fac[MAX], finv[MAX], inv[MAX];

void ConInit(LL M) {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % M;
        inv[i] = M - inv[M%i] * (M / i) % M;
        finv[i] = finv[i - 1] * inv[i] % M;
    }
}

LL COM(int n, int k, LL M){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % M) % M;
}

template<class T> void VCout(vector<T> v){
  int N = SZ(v);
  REP(i,N){
    cout << v.at(i);
    if(i == N-1)ENDL;
    else SPACE;
  }
  return;
}

bool VSo1(VLL x,VLL y){
  return x.at(3) > y.at(3);
}
bool VSo2(VLL x,VLL y){
  return x.at(4) > y.at(4);
}
bool VSo3(VLL x,VLL y){
  return x.at(5) > y.at(5);
}
bool VSo4(VLL x,VLL y){
  return x.at(6) > y.at(6);
}
bool VSo5(VLL x,VLL y){
  return x.at(7) > y.at(7);
}
bool VSo6(VLL x,VLL y){
  return x.at(8) > y.at(8);
}
bool VSo7(VLL x,VLL y){
  return x.at(9) > y.at(9);
}
bool VSo8(VLL x,VLL y){
  return x.at(10) > y.at(10);
}


int main() {
  
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  int N,M;
  cin >> N >> M;
  
  VVLL x(N,VLL(11));
  
  REP(i,N){
    cin >> x.at(i).at(0) >> x.at(i).at(1) >> x.at(i).at(2);
  }
  
  BREP(bit,3){
    REP(i,N){
      REP(j,3){
        if(bit>>j & 1) x.at(i).at(bit+3) += x.at(i).at(j);
        else x.at(i).at(bit+3) -= x.at(i).at(j);
      }
    }
  }
  LL ans = 0;
  sort(ALL(x),VSo1);
  LL a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo2);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo3);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo4);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo5);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo6);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo7);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  sort(ALL(x),VSo8);
  a=0,b=0,c=0;
  REP(i,M){
    a += x.at(i).at(0);
    b += x.at(i).at(1);
    c += x.at(i).at(2);
  }
  chmax(ans, abs(a)+abs(b)+abs(c));
  COUT(ans);
  return 0;
}

Measured memory_bytes: 384