Takahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.

More specifically, in one move, he can go from coordinate x to x + D or x - D.

He wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.

Find the minimum possible absolute value of the coordinate of the destination.

Constraints

* -10^{15} \leq X \leq 10^{15}
* 1 \leq K \leq 10^{15}
* 1 \leq D \leq 10^{15}
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


X K D


Output

Print the minimum possible absolute value of the coordinate of the destination.

Examples

Input

6 2 4


Output

2


Input

7 4 3


Output

1


Input

10 1 2


Output

8


Input

1000000000000000 1000000000000000 1000000000000000


Output

1000000000000000
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner scan = new Scanner(System.in);
		long x = scan.nextLong();
		long k = scan.nextLong();
		long d = scan.nextLong();
		
		x = Math.abs(x);
		
		long near = (x/d);
		long stop = k - near;
		if(stop < 0) {
			stop = 0;
		}
		/*
		System.out.println(near);
		System.out.println(stop);  
		*/
		
		
		
		if(k < near) {
			x -= k * d;
			System.out.print(Math.abs(x));
			return;
		}
		
		
		
		if( stop % 2 == 0) {
			x -= near * d;
			System.out.print(Math.abs(x));
			return;
		}
		else {
			x -= near * d;
			
			if(Math.abs(x+d) < Math.abs(x-d)) {
				System.out.print(Math.abs(x+d) );
				return;
			}
			else if(Math.abs(x+d) > Math.abs(x-d)) {
				System.out.print(Math.abs(x-d));
				return;
			}
			else {
				
				System.out.print(Math.abs(x+d) );
				return;
			}
		}
	}

}
