output_description: 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.
  
  * * *
input_description: 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
attempt: #!/usr/bin/env python3
  # -*- coding: utf-8 -*-
  """
  Created on Sat Jun 16 21:53:05 2018
  
  @author: Riichi_Yokoyama
  """
  
  
  import numpy as np
  
  N, M = map(int, input().split())
  a = []
  for i in range(N):
      a.append(list(map(int, input().split())))
  
  ar = np.array(a)
  print(ar)
  
  b = np.zeros((N, 8))
  for i in range(0, N):
      b[i, 0] = ar[i, 0] + ar[i, 1] + ar[i, 2]
      b[i, 1] = ar[i, 0] + ar[i, 1] - ar[i, 2]
      b[i, 2] = ar[i, 0] - ar[i, 1] + ar[i, 2]
      b[i, 3] = ar[i, 0] - ar[i, 1] - ar[i, 2]
      b[i, 4] = -ar[i, 0] + ar[i, 1] + ar[i, 2]
      b[i, 5] = -ar[i, 0] + ar[i, 1] - ar[i, 2]
      b[i, 6] = -ar[i, 0] - ar[i, 1] + ar[i, 2]
      b[i, 7] = -ar[i, 0] - ar[i, 1] - ar[i, 2]
  
  e0 = np.asarray([0, 0, 0, 0, 0, 0, 0, 0])
  
  c0 = b[:, 0]
  d0 = np.sort(c0)[::-1]
  e0[0] = sum(d0[:M])
  
  c1 = b[:, 1]
  d1 = np.sort(c1)[::-1]
  e0[1] = sum(d1[:M])
  
  c2 = b[:, 2]
  d2 = np.sort(c2)[::-1]
  e0[2] = sum(d2[:M])
  
  c3 = b[:, 3]
  d3 = np.sort(c3)[::-1]
  e0[3] = sum(d3[:M])
  
  c4 = b[:, 4]
  d4 = np.sort(c4)[::-1]
  e0[4] = sum(d4[:M])
  
  c5 = b[:, 5]
  d5 = np.sort(c5)[::-1]
  e0[5] = sum(d5[:M])
  
  c6 = b[:, 6]
  d6 = np.sort(c6)[::-1]
  e0[6] = sum(d6[:M])
  
  c7 = b[:, 7]
  d7 = np.sort(c7)[::-1]
  e0[7] = sum(d7[:M])
  
  
  e1 = np.sort(e0)[::-1]
  print(e1[0])
  
problem_description: 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.
samples: [{"input": "5 3\n    3 1 4\n    1 5 9\n    2 6 5\n    3 5 8\n    9 7 9", "output": "56\n    \n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty,\ntastiness and popularity will be as follows:\n\n  * Beauty: 1 + 3 + 9 = 13\n  * Tastiness: 5 + 5 + 7 = 17\n  * Popularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of\nthe total tastiness) + (the absolute value of the total popularity) here is 13\n+ 17 + 26 = 56. This is the maximum value.\n\n* * *"}, {"input": "5 3\n    1 -2 3\n    -4 5 -6\n    7 -8 -9\n    -10 11 -12\n    13 -14 15", "output": "54\n    \n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty,\ntastiness and popularity will be as follows:\n\n  * Beauty: 1 + 7 + 13 = 21\n  * Tastiness: (-2) + (-8) + (-14) = -24\n  * Popularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of\nthe total tastiness) + (the absolute value of the total popularity) here is 21\n+ 24 + 9 = 54. This is the maximum value.\n\n* * *"}, {"input": "10 5\n    10 -80 21\n    23 8 38\n    -94 28 11\n    -26 -2 18\n    -69 72 79\n    -26 -86 -54\n    -72 -50 59\n    21 65 -32\n    40 -94 87\n    -62 18 82", "output": "638\n    \n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total\nbeauty, tastiness and popularity will be -323, 66 and 249, respectively.  \nThe value (the absolute value of the total beauty) + (the absolute value of\nthe total tastiness) + (the absolute value of the total popularity) here is\n323 + 66 + 249 = 638. This is the maximum value.\n\n* * *"}, {"input": "3 2\n    2000000000 -9000000000 4000000000\n    7000000000 -5000000000 3000000000\n    6000000000 -1000000000 8000000000", "output": "30000000000\n    \n\nThe values of the beauty, tastiness and popularity of the cakes and the value\nto be printed may not fit into 32-bit integers."}]