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));
			
		}
		
		
		

	}
	
	
}
// Mario Morales

import java.util.*;
import java.io.*;

public class p3{
  public static void main(String[] args) throws Exception{
  	BufferedReader f = new BufferedReader(new FileReader("input3small.txt"));
  	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("answer3small.txt")));

    //Brute Force Solution
    int t = Integer.parseInt(f.readLine()); //# of test cases
    StringTokenizer st;
    int a, b, d, res;
    String aNew;
    for(int i=0; i<t; i++){
        st = new StringTokenizer(f.readLine());
        a = Integer.parseInt(st.nextToken());//bounds
        b = Integer.parseInt(st.nextToken());
        d = (""+a).length();//number of digits
        res = 0;

        for(int a1=a; a1<b; a1++){
            for(int b1=a1+1; b1<=b; b1++){
                //move n rightmost digits
                for(int n=1; n<d; n++){
                    aNew = (""+a1).substring(d-n, d) + (""+a1).substring(0, d-n);
                    if(aNew.equals(""+b1)){
                        res++;
                        break;
                    }
                }
            }
        }
    	out.println("Case #" + (i+1) + ": " + res);
    }

    out.close();
    System.exit(0);
  }
}
