For this Question: Given two integers N and M, your task is to print the number of primes present between N and M (both included).

<b>Note</b>:- You have already provided a function that will check if the given number is prime or not. To use the given function you need to call <b>check_prime(x)</b> where x is the number you want to check. If the given number is prime the function will return 1 else it returns 0.

<b>Note</b>:- Do not close your main class.The input contains two space- separated integers depicting the values of N and M.

Constraints:-
1 <= N <= M <= 10000Print the count of prime numbers in the given range.Sample Input:-
1 10

Sample Output:-
4

Sample Input:-
8 10

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

class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int m = sc.nextInt();
		int cnt=0;
		for(int i=n;i<=m;i++){
		    if(check_prime(i)==1){cnt++;}
		}
	    System.out.println(cnt);
	
	
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?