

CoprimeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13848 Accepted Submission(s): 5475 Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are said to be coprime or relatively prime if they have no common positive divisors other than 1 or, equivalently, if their greatest common divisor is 1. The number 1 is relatively prime to every integer. Input The first line on input contains T (0 < T <= 100) the number of test cases, each of the next T lines contains three integers A, B, N where (1 <= A <= B <= 10^{15}) and (1 <=N <= 10^{9}). Output For each test case, print the number of integers between A and B inclusive which are relatively prime to N. Follow the output format below. Sample Input
Sample Output
Hint In the first test case, the five integers in range [1,10] which are relatively prime to 2 are {1,3,5,7,9}. Source  
