Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?

Constraints

* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.

Input

Input is given from Standard Input in the following format:


N A B


Output

Print the number of the different possible sums.

Examples

Input

4 4 6


Output

5


Input

5 4 3


Output

0


Input

1 7 10


Output

0


Input

1 3 3


Output

1
import java.util.Scanner;


public class Main
{

	public static void main(String[] args)
	{
		// TODO Auto-ge
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			long x=sc.nextLong(),y=sc.nextLong(),z=sc.nextLong();
			if(y>z||(x==1 && y!=z))System.out.println(0);
			else if(y==z)System.out.println(1);
			else System.out.println((x-2)*(z-y)+1);
		}
	}

}
