N,M = map(int,input().split())
A = [list(map(int,input().split())) for i in range(N)]

S = [sum(A[i]) for i in range(N)]

tmp_A = [[A[i][j] for j in range(N)] for i in range(N)]

def dfs(i,cost,cnt):
    res = 10**18
    if i==N+2:
        column = [sum(tmp_A[k][j] for k in range(N)) for j in range(N)]
        column.sort()
        cost += sum(column[:cnt])
        return cost
    elif i<N:
        tmp1 = dfs(i+1,cost,cnt)
        for j in range(N):
            tmp_A[i][j] = 0
            cost += A[i][j]
        tmp2 = dfs(i+1,cost,cnt-1)
        for j in range(N):
            tmp_A[i][j] = A[i][j]
        return min(res,tmp1,tmp2)
    elif i==N:
        tmp1 = dfs(i+1,cost,cnt)
        memo = [tmp_A[j][j] for j in range(N)]
        for j in range(N):
            tmp_A[j][j] = 0
            cost += memo[j]
        tmp2 = dfs(i+1,cost,cnt-1)
        for j in range(N):
            tmp_A[j][j] = memo[j]
        return min(res,tmp1,tmp2)
    else:
        tmp1 = dfs(i+1,cost,cnt)
        memo = [tmp_A[N-1-j][j] for j in range(N)]
        for j in range(N):
            tmp_A[N-1-j][j] = 0
            cost += memo[j]
        tmp2 = dfs(i+1,cost,cnt-1)
        for j in range(N):
            tmp_A[N-1-j][j] = memo[j]
        return min(res,tmp1,tmp2)

print(dfs(0,0,M))