#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, m;
struct Tree
{
    int id;
    int nums;

    bool operator < (const Tree &W) const
    {
        if (nums != W.nums) return nums > W.nums;
        return id < W.id;
    }
 } tree[N];

int main()
{
    cin >> n >> m;
    int sum = 0;
    for (int i = 1; i <= n; i ++ )
    {
        int t;
        cin >> t;
        int sub = 0;
        for (int j = 0; j < m; j ++ )
        {
            int x;
            cin >> x;
            sum += x;
            sub += x;
        }
        sum += t;
        tree[i] = {i, -sub};
    }
    sort(tree + 1, tree + n + 1);

    printf("%d %d %d\n", sum, tree[1].id, tree[1].nums);
    return 0;
}