Problem:
Score : 300 points

Problem Statement

There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.

On this sequence, Snuke can perform the following operation:

Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.

Snuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.
Find the minimum number of operations required.
It can be proved that, Under the constraints of this problem, this objective is always achievable.

Constraints

2 \leq K \leq N \leq 100000

A_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.

Input

Input is given from Standard Input in the following format:

N K
A_1 A_2 ... A_N

Output

Print the minimum number of operations required.

Sample Input 1

4 3
2 3 1 4

Sample Output 1

2

One optimal strategy is as follows:

In the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.

In the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.

Sample Input 2

3 3
1 2 3

Sample Output 2

1

Sample Input 3

8 3
7 3 1 8 4 6 2 5

Sample Output 3

4

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

n, k = gets.strip.split.map(&:to_i)
as = gets.strip.split.map(&:to_i)

# まず1の場所を探す
i1 = as.index(1)

# 左端
il = [i1 - k + 1, 0].max

# 右端
ir = [i1 + k - 1, n - 1].min

def ceil(p, q)
    p % q == 0 ? p / q : p / q + 1
end

min = 10000000000
(il..i1).each do |left|
    puts "left = #{left}, min = #{min}"
    if left == 0
        r = ceil(n - k, k - 1) + 1
        min = [r, min].min
        puts "left = #{left}, new_min = #{min}"
    elsif left + k >= n - 1
        l = ceil(left, k - 1) + 1
        min = [l, min].min
    else
        both = ceil(n - ir, k - 1) + ceil(left, k - 1) + 1
        min = [both, min].min
        puts "left = #{left}, new_min = #{min}"
    end
end

puts min