import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.*;


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

        FileInputStream getFile = new FileInputStream("C:\\1\\in1.txt");

        PrintWriter out = new PrintWriter(new File("C:\\1\\output.out"));
        BufferedReader br = new BufferedReader(new InputStreamReader(getFile));

        String strLine;
        strLine = br.readLine().trim();
        int test = Integer.parseInt(strLine);

        for (int i=0;i<test;i++) {
            strLine = br.readLine().trim();
            long incrementor = 0;
            String[] strings = strLine.split(" ");
            long A = Integer.parseInt(strings[0].trim());
            long B = Integer.parseInt(strings[1].trim());
            for (long num = A; num <= B; num++) {
                incrementor = incrementor + CodeJadu(num, A, B);
            }
            int k = i+1;
            out.println("Case #" + k + ": " + incrementor);
        }
        out.flush();
        out.close();
        br.close();
    }
    public static long CodeJadu(long present, long A, long B)
    {
        long initial = present;
        long sum = 0;
        int numdigits = (int) Math.log10((double)present);
        int multiplier = (int) Math.pow(10.0, (double)numdigits);
        while(true)
        {
            long q = present / 10;
            long r = present % 10;
            present = present / 10;
            present = present + multiplier * r;
            if(present == initial)
                break;
            if (initial < A) break;
            if (initial >= A && initial < present && present <= B) {
                sum++;
            }
        }
        return sum;


    }
}