For this Question: Given a range from l to r, Your task is to find the sum of the second last digit of the prime numbers between that range.The first line of the input contains the T test cases.
Next T lines contains the range value l and r.

<b>Constraints</b>
1 <= T <= 100
1 <= l < r <= 1e5
Difference between l and r dosen't exceed 1e4.Print the required sum.Sample Input 1:
3
2 15
1 20
3 10

Sample Output 1:
2
4
0, I have written this Solution Code: import java.io.*;
import java.util.*;



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

                      Scanner sc = new Scanner(System.in);
                      int t = sc.nextInt();

                      while(t-->0){
                          int n = sc.nextInt();
                          int m = sc.nextInt();

                          System.out.println(getPrimeSum(n,m));
                      }
                    }

                     public static int getPrimeSum(int n, int m){
                         int sum =0;
                        for(int i=n;i<=m;i++){
                            if(checkprime(i)){
                                int x=i;
                                sum += (i%100)/10;
                            }
                        }
                        return sum;
                     }


                    public static boolean checkprime(int n){
                     for(int i =2;i<=Math.sqrt(n);i++){
                     if(n%i==0){
                      return false;
                       }
                     }
                      return true;
                 }


}, In this Programming Language: Java, Now tell me if this Code is compilable or not?