import itertools

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx +=1
    M = int(input[idx])
    idx +=1

    A = []
    for _ in range(N):
        row = list(map(int, input[idx:idx+N]))
        idx += N
        A.append(row)
    
    lines = []
    # Rows
    for i in range(N):
        line = []
        for j in range(N):
            line.append((i, j))
        lines.append(line)
    # Columns
    for j in range(N):
        line = []
        for i in range(N):
            line.append((i, j))
        lines.append(line)
    # Diagonals
    if N >=1:
        diag1 = []
        for i in range(N):
            diag1.append((i, i))
        lines.append(diag1)
        diag2 = []
        for i in range(N):
            diag2.append((i, N-1 -i))
        lines.append(diag2)
    
    min_total = float('inf')
    for k in range(M, len(lines)+1):
        if k > len(lines):
            break
        for subset in itertools.combinations(lines, k):
            covered = set()
            for line in subset:
                for cell in line:
                    covered.add(cell)
            total = sum(A[i][j] for i,j in covered)
            if total < min_total:
                min_total = total
        if min_total != float('inf'):
            break
    
    print(min_total)

if __name__ == '__main__':
    main()