csp201909-1

#include <cstdio>
 #include <iostream>
 #include <cmath>
 #include <algorithm>
 
 using namespace std;
 
 int main()
 {
 	int n, m, max = -1, ans1 = 0, k = 0;
 	int guo1, guo2, ans2;
 	cin >> n >> m; 
 	for (int i = 0; i < n; i++){
 		k = i ;
 		ans2 = 0;//要清零，这个点一开始没注意，找了好久
 		cin >> guo1;
 		ans1 += guo1;
 		for (int j = 0; j < m; j++){
 			cin >> guo2;
 			ans2 += guo2;
	    }
	     ans1 += ans2;
		 if (abs (ans2) > max){
		 	max = abs(ans2);
		 }
	 }
	 cout << ans1 << ' ' << k << ' ' << max;
	 return 0;
 }