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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.TreeMap;

class Recycled {
    public static void main(String args[]) throws IOException{
        Scanner in = new Scanner(new File("recycle.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("recycle.out")));
        TreeMap<Integer, ArrayList<Integer> > map = new TreeMap<Integer, ArrayList<Integer> >();
        for(int i = 1; i <= 2000000; i++){
            ArrayList<Integer> arr = new ArrayList<Integer>();
            String it = "" + i;
            for(int k = 0; k < it.length(); k++){
                int temp = Integer.parseInt(it.substring(k + 1, it.length()) + it.substring(0, k+1));
                if(temp > i){
                    boolean add = true;
                    for(int ad = 0; ad < arr.size(); ad++){
                        if(temp==arr.get(ad)) add = false;
                    }
                    if(add) arr.add(temp);
                }
            }
            Collections.sort(arr);
            map.put(i, arr);
        }
        int cases = in.nextInt();
        for(int c = 1; c <= cases; c++){
            int A = in.nextInt();
            int B = in.nextInt();
            int pass = 0;
            for(int a = A; a < B; a++){
                if(map.get(a)==null) continue;
                ArrayList<Integer> list = map.get(a);
                for(int l = 0; l < list.size(); l++){
                    if(list.get(l) <= B) pass++;
                    else break;
                }
            }
            String out = "Case #" + c + ": " + pass;
            fw.println(out);
        }
        fw.close();
    }
}
