Problem: There are K lemurs on Madagascar and Kevin has N bananas. He has to give away all his bananas to lemurs. Lemurs are happy if all of them get the same number of bananas (even if they don't get any). In one minute Kevin can do one of the following:
 Find one banana. 
 Discard one banana (eat). 
 Increase a population of lemurs on Madagascar by one. 
 If there are at least two lemurs remove one of them from Madagascar (don't ask how). 

Help Kevin and find the minimum number of minutes Kevin needs to satisfy all the lemurs.

Input format:

The only line of the input contains two space-separated integers N and K.

Output format:

Output the single integer -- the minimum number of minutes.

Constraints:
1 ≤ K,N ≤ 10^5
K, N ≤ 50 in test data worth 33% of all points

SAMPLE INPUT
47 17

SAMPLE OUTPUT
2

Solution (in PYTHON):

Solution:
def change(n, k):
    if not n % k:
        return 0
    m = n % k
    return min(m, k - m)


def main():
    n, k = [int(s) for s in raw_input().split()]
    time = 10000000000
    for i in xrange(k):
        if i >= time: break
        time = min(time, i + change(n, k + i), i + change(n, k - i))
    print(time)


main()