#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,m;
int num,maxm;
vector<pair<int,int>> arr;
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        int sum=0;
        for(int j=1;j<=m;j++){
            int y;
            cin>>y;
            y=-1*y;
            x-=y;
            sum+=y;
        }
        num+=x;
        maxm=max(maxm,sum);
        arr.push_back(make_pair(sum,i));
    }
    sort(arr.begin(),arr.end());
    int j;
    for(int i=0;i<arr.size();i++){
        if(arr[i].first==maxm){
            j=arr[i].second;
            break;
        }
    }
    cout<<num<<' '<<j<<' '<<maxm;
    return 0;
}