Mirko received an $N \times N$ table for his birthday, where a non-negative integer is written in each field of the table. Unfortunately, the written numbers are too large for Mirko’s taste, so he will place $K$ dominoes on top of the table that will cover the fields that are too large. More precisely, Mirko places the dominoes according to the following rules:
 - each domino covers two fields of the table that are adjacent in a row or in a column,
 - the dominoes do not overlap (but can touch),
 - the sum of all visible (uncovered) fields needs to be as small as possible.

It is your task to determine the required minimal sum of visible fields. The test data will be such that it will always be possible to place $K$ dominoes without overlapping.

-----Input-----
The first line of input contains the integers $N$ ($1 \leq N \leq 2000$), the dimensions of the table, and $K$ ($1 \leq K \leq 8$), the number of dominoes. Each of the following $N$ lines contains $N$ integers from the interval $[0, 1000]$. These $N \times N$ numbers describe Mirko’s table.

-----Output-----
The first and only line of output must contain the minimal sum of visible fields after covering the table with dominoes.

-----Examples-----
Sample Input:
3 1
2 7 6
9 5 1
4 3 8
Sample Output:
31

Difficulty: competition

Starter code:

Solutions: