For this Question: You think that integers divisible by K are nice. Given L and R (L<=R), find the number of nice integers from L to R (both inclusive).First Line of input contains three integers L R K

Constraints : 
0 <= L <= R <= 1000000000000000000(10^18)
1 <= K <=  1000000000000000000(10^18)Output a single integer which is the number of nice integers from L to R (both inclusive).Sample input 1 
1 10 2

Sample output 1
5

Sample intput 2
4 5 3

Sample output 2
0

Explanation:-
Required divisors = 2 4 6 8 10, I have written this Solution Code: 









import java.io.*;
import java.util.*;
class Main{
    public static void main(String[] args)throws IOException{

      BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String str[]=br.readLine().split(" ");
        long l=Long.parseLong(str[0]);
        long r=Long.parseLong(str[1]);
        long k=Long.parseLong(str[2]);
        long count=(r/k)-((l-1)/k);



        System.out.print(count);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?