CCFCSP 20190901小明种苹果 python求解

n,m=map(int,input().split())
applesum=[]
decrease=[]
t1=0
for i in range(n):
t=list(map(int,input().split()))
applesum.append(t[0])
for j in range(m):
t1+=t[j+1]
decrease.append(t1)
t1=0
de=sum(decrease)
sum1=sum(applesum)+de
k=decrease.index(min(decrease))+1
p=abs(min(decrease))
print(sum1,k,p)