Problem:
Score : 100 points

Problem Statement

Takahashi is distributing N balls to K persons.

If each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?

Constraints

1 \leq K \leq N \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

Print the maximum possible difference in the number of balls received.

Sample Input 1

3 2

Sample Output 1

1

The only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.

Thus, the maximum possible difference in the number of balls received is 1.

Sample Input 2

3 1

Sample Output 2

0

We have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.

Sample Input 3

8 5

Sample Output 3

3

For example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

N = gets.to_i
arr = gets.split.map(&:to_i)

logs = []

while(arr.count != 1)
  arr.sort!
  min = arr.shift
  max = arr.pop

  if arr.count % 2 == 0
    arr.push(max - min)
    logs.push([max, min])
  else
    arr.push(min - max)
    logs.push([min, max])
  end
end

puts arr.first
logs.each { |log| puts "#{log[0]} #{log[1]}"}