Input Format


N K
a_1 a_2 a_3 ... a_N


Output Format

Print the minimum cost in one line. In the end put a line break.


Constraints

* 1 ≤ K ≤ N ≤ 15
* 1 ≤ a_i ≤ 10^9



Scoring

Subtask 1 [120 points]


* N = K

Subtask 2 [90 points]


* N ≤ 5
* a_i ≤ 7

Subtask 3 [140 points]


* There are no additional constraints.

Output Format

Print the minimum cost in one line. In the end put a line break.


Constraints

* 1 ≤ K ≤ N ≤ 15
* 1 ≤ a_i ≤ 10^9



Scoring

Subtask 1 [120 points]


* N = K

Subtask 2 [90 points]


* N ≤ 5
* a_i ≤ 7

Subtask 3 [140 points]


* There are no additional constraints.

Input Format


N K
a_1 a_2 a_3 ... a_N

Example

Input

5 5
3949 3774 3598 3469 3424


Output

1541
N, K = map(int, input().split())
a = list(map(int, input().split()))
ans = 10**19

for bit in range(2**N):
    if bin(bit).count('1') != K:
        continue

    cost, height = 0, 0
    for i in range(N):
        if bit & (1 << i) == 0:
            if height < a[i]:
                height = a[i]
            continue
        if height >= a[i]:
            cost += height - a[i] + 1
            height += 1
        else:
            height = a[i]

    if ans > cost:
        ans = cost

print(ans)
