Problem Statement

Takahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.

The shop sells $N$ kinds of cakes. Each kind of cake has three parameters "beauty", "tastiness" and "popularity". The $i$-th kind of cake has the beauty of $x_i$, the tastiness of $y_i$ and the popularity of $z_i$. These values may be zero or negative.

Ringo has decided to have $M$ pieces of cakes here. He will choose the set of cakes as follows:

• Do not have two or more pieces of the same kind of cake.
• Under the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).

Find the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.

Constraints

• $N$ is an integer between $1$ and $1 \ 000$ (inclusive).
• $M$ is an integer between $0$ and $N$ (inclusive).
• $x_i, y_i, z_i \ (1 \leq i \leq N)$ are integers between $-10 \ 000 \ 000 \ 000$ and $10 \ 000 \ 000 \ 000$ (inclusive).

Input

Input is given from Standard Input in the following format:

N M
x_1 y_1 z_1
x_2 y_2 z_2
 :  :
x_N y_N z_N

Output

Print the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.