시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 32 MB144594940.496%

## 문제

Little Mislav owns N glasses of infinite volume, and each glass contains some water. Mislav wants to drink all the water, but he doesn’t want to drink from more than K glasses. What Mislav can do with the glasses is pour the total volume of water from one glass to another.

Unfortunately, it matters to Mislav what glass he picks, because not all glasses are equally distant to him. More precisely, the amount of effort it takes to pour water from glass labeled with i to glass labeled j is denoted with Cij.

Help Mislav and find the order of pouring the water from one glass to another such that the sum of effort is minimal.

## 입력

The first line of input contains integers N, K (1 ≤ K ≤ N ≤ 20).

The following N lines contains N integers Cij (0 ≤ Cij ≤ 105 ). The ith row and jth column contains value Cij . It will hold that each Cii is equal to 0.

## 출력

Output the minimal effort needed for Mislav to achieve his goal.

## 예제 입력 1

3 3
0 1 1
1 0 1
1 1 0


## 예제 출력 1

0


## 예제 입력 2

3 2
0 1 1
1 0 1
1 1 0


## 예제 출력 2

1


## 예제 입력 3

5 2
0 5 4 3 2
7 0 4 4 4
3 3 0 1 2
4 3 1 0 5
4 5 5 5 0


## 예제 출력 3

5


## 힌트

​Mislav doesn’t need to pour water in order to drink from at most 3 glasses.