import java.util.Scanner;
public class test190901 {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int m=in.nextInt();
int arr[][]=new int[n][m+1];
for(int i=0;i<n;i++)
for(int j=0;j<m+1;j++)
{
arr[i][j]=in.nextInt();
}
int T=0,k=0,P=0;
for(int i=0;i<n;i++) {
int add=0;
for(int j=0;j<m+1;j++)
{
if(j>0)
add+=arr[i][j];
T+=arr[i][j];
}
add=-add;
if(i==0)
P=add;
else if(add>P)
{
P=add;
k=i;
}
}
System.out.print(T+" "+(k+1)+" "+P);
}
}
小明种苹果(续)
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in =new Scanner(System.in);
int T=0,D=0,E=0;
int N=in.nextInt();
int num[]=new int[N];
int drop[]=new int[N];
Arrays.fill(num,0);
Arrays.fill(drop,0);
for(int i=0;i<N;i++)
{
int m=in.nextInt();
for(int j=0;j<m;j++) {
int input=in.nextInt();
if(input>0) {
if(j!=0&&num[i]>input)
drop[i]=1;
num[i]=input;
}
else
num[i]+=input;
}
}
for(int i=0;i<N;i++)
{
T+=num[i];
if(drop[i]==1)
D++;
if(drop[i-1>=0?i-1:N-i-1]==1&&drop[i]==1&&drop[i+1<N?i+1:i+1-N]==1)
{
E++;
}
}
System.out.print(T+" "+D+" "+E);
}
}