import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
ulong bignum = 1_000_000_007;
alias Cake = Tuple!(long, "beauty", long, "tasty", long, "popular");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    long n, m;
    scan(n, m);
    auto cakes = new Cake[](n);
    foreach (ref e; cakes)
    {
        long a, b, c;
        scan(a, b, c);
        e = Cake(a, b, c);
    }
    long max_sum;
    cakes.sort!"a.beauty + a.tasty + a.popular > b.beauty + b.tasty + b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"a.beauty + a.tasty - a.popular > b.beauty + b.tasty - b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"a.beauty - a.tasty + a.popular > b.beauty - b.tasty + b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"a.beauty - a.tasty - a.popular > b.beauty - b.tasty - b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"-a.beauty + a.tasty + a.popular > -b.beauty + b.tasty + b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"-a.beauty + a.tasty - a.popular > -b.beauty + b.tasty - b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"-a.beauty - a.tasty + a.popular > -b.beauty - b.tasty + b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);
    cakes.sort!"-a.beauty - a.tasty - a.popular > -b.beauty - b.tasty - b.popular"();
    max_sum = max(cakes.take(m).tuple_sum, max_sum);

    max_sum.writeln();
}

auto tuple_sum(T)(T tupary)
{
    auto sum = Cake(0, 0, 0);
    foreach (e; tupary)
    {
        sum[0] += e[0];
        sum[1] += e[1];
        sum[2] += e[2];
    }
    // sum.writeln();
    return abs(sum.beauty) + abs(sum.tasty) + abs(sum.popular);
}