import java.util.Scanner; public class 小明种苹果 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m=sc.nextInt(); int[] tree=new int[n]; int[][] a=new int[n][m]; for(int i=0;i<n;i++){ tree[i]=sc.nextInt(); for(int j=0;j<m;j++){ a[i][j]=sc.nextInt(); } } int t=0; int[] p=new int[n]; int max=p[0]; int index=-1; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ p[i]=p[i]-a[i][j]; if(p[i]>max){ max=p[i]; index=i+1; } } t=tree[i]-p[i]+t; } System.out.println(t+" "+index+" "+max); } }
