package alg;

import java.util.Scanner;

public class Msum {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(),m = sc.nextInt();
        int [][]a = new int[110][110];
        int sum = 0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                a[i][j] = sc.nextInt();
                sum+=a[i][j];
            }
        }
        int[]h= new int[n+1];
        //统计行矩阵
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                h[i]+=a[i][j];
            }
        }

        int []t = new int[m+1];
        //统计列矩阵
        for(int j=0;j<m;j++){
            for(int i=0;i<n;i++){
                t[j]+=a[i][j];
            }
        }

        int idex = 0;
        int res = Integer.MAX_VALUE;
        int ivalue = 0;
        //找出横坐标
        for(int i=0;i<n;i++){
            ivalue += h[i];
            res = Math.min(res,Math.abs(sum-ivalue-ivalue));
        }
        int jvalue = 0;
        //找出纵坐标
        for(int j=0;j<m;j++){
            jvalue+=t[j];
            res = Math.min(res,Math.abs(sum-jvalue-jvalue));
        }
        System.out.println(res);

    }
}