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: import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def main():
      N, M = map(int, input().split())
      cakes = [(0, 0, 0)]
      for _ in range(N):
          x, y, z = map(int, input().split())
          cakes.append((x, y, z))
  
      """
      dp[n][m][t] = (1~n番目までのケーキからm個のケーキをタイプtで選んだ時の合計の最大値)
      と定める。ここでタイプとは
          t=0 -> val = x + y + z
          t=1 -> val = x + y - z
          t=2 -> val = x - y + z
          t=3 -> val = x - y - z
          t=4 -> val = -x + y + z
          t=5 -> val = -x + y - z
          t=6 -> val = -x - y + z
          t=7 -> val = -x - y - z
      どのタイプにせよ更新式は同じで、dp[n][m] = max(dp[n-1][m], dp[n-1][m-1] + (n番目のdp = [0]aaa))
      """
  
      dp = [[[0] * 8 for _ in range(M + 1)] for _ in range(N + 1)]
      for n in range(1, N + 1):
          x, y, z = cakes[n]
          for m in range(1, min(M + 1, n + 1)):
              if n == m:
                  dp[n][m][0] = dp[n - 1][m - 1][0] + (x + y + z)
                  dp[n][m][1] = dp[n - 1][m - 1][1] + (x + y - z)
                  dp[n][m][2] = dp[n - 1][m - 1][2] + (x - y + z)
                  dp[n][m][3] = dp[n - 1][m - 1][3] + (x - y - z)
                  dp[n][m][4] = dp[n - 1][m - 1][4] + (-x + y + z)
                  dp[n][m][5] = dp[n - 1][m - 1][5] + (-x + y - z)
                  dp[n][m][6] = dp[n - 1][m - 1][6] + (-x - y + z)
                  dp[n][m][7] = dp[n - 1][m - 1][7] + (-x - y - z)
              else:
                  dp[n][m][0] = max(dp[n - 1][m][0], dp[n - 1][m - 1][0] + (x + y + z))
                  dp[n][m][1] = max(dp[n - 1][m][1], dp[n - 1][m - 1][1] + (x + y - z))
                  dp[n][m][2] = max(dp[n - 1][m][2], dp[n - 1][m - 1][2] + (x - y + z))
                  dp[n][m][3] = max(dp[n - 1][m][3], dp[n - 1][m - 1][3] + (x - y - z))
                  dp[n][m][4] = max(dp[n - 1][m][4], dp[n - 1][m - 1][4] + (-x + y + z))
                  dp[n][m][5] = max(dp[n - 1][m][5], dp[n - 1][m - 1][5] + (-x + y - z))
                  dp[n][m][6] = max(dp[n - 1][m][6], dp[n - 1][m - 1][6] + (-x - y + z))
                  dp[n][m][7] = max(dp[n - 1][m][7], dp[n - 1][m - 1][7] + (-x - y - z))
      print(max(dp[N][M]))
  
  
  if __name__ == "__main__":
      main()
  
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."}]