For this Question: Ketani is fond of super simple problems. This time he has come up with another simple problem. Given two non negative numbers A and B. Find the number of multiples of k in the range [A, B] (all integers between A and B, A and B inclusive).The first and the only line of input contains three integers: A B k.

Constraints
0 <= a <= b <= 1000000000000000000 (10^18)
1 <= x <= 1000000000000000000 (10^18)Output a single integer, the number of multiples of k in the given range.Sample Input
4 8 2

Sample Output
3

Explanation: The divisors of 2 in the range [4, 8] are 4, 6, and 8.

Sample Input:
0 5 1

Sample Output:
6, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException {

		InputStreamReader ir = new InputStreamReader(System.in);
		BufferedReader br = new BufferedReader(ir);
		String[] inputs = br.readLine().split(" ");
		long A = Long.parseLong(inputs[0]);
		long B = Long.parseLong(inputs[1]);
		long k = Long.parseLong(inputs[2]);
		long minMultiple = A/k;
		long maxMultiple = B/k;
		long compensattion = 0;
		if(A % k == 0){
			compensattion = 1;
		}
		long answer = maxMultiple+compensattion-minMultiple;
		System.out.println(answer);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?