n,m = map(int,input().split())
ls=[[]for i in range(n)]
for i in range(n):
    ls[i]=list(map(int,input().split()))
socre=0
#循环处理n行

xmin=[[0,m-1]for i in range(n)]
for j in range(m):
    for i in range(n):
        l=xmin[i][0]
        r=xmin[i][1]
        if(ls[i][l]<ls[i][r]):          
            socre=socre+ls[i][l]*pow(2,j+1)
            xmin[i][0]=xmin[i][0]+1
        else:
            socre=socre+ls[i][r]*pow(2,j+1)
            xmin[i][1]=xmin[i][1]-1

print(socre)