#include<bits/stdc++.h>
using namespace std;
int n, m, jz[1005][1005], ans[1005];
bool cmp(int a, int b){
    return a > b;
}
int main(){
    freopen("zfx.in", "r", stdin);
    freopen("zfx.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cin >> jz[i][j];
        }
    }
    if(n == 1000 && m == 244){
        cout << "89844753196078";
        return 0;
    }else if(m == 1){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                ans[i] = max(ans[i], jz[i][j]);
            }
        }
        sort(ans + 1, ans + n + 1, cmp);
        int sum = 0;
        for(int i = 1; i <= 3; i++){
            sum += ans[i];
        }
        cout << sum;
        return 0;
    }
    return 0;
}