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

	}
	
	
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

import java.util.Scanner;

/**
 *
 * @author Abdo
 */
public class problemb {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        sc.nextLine();
        int[] a=new int[n];
        int[] b=new int[n];
        for(int k=0;k<n;k++)
        {
             a[k]=sc.nextInt();
             b[k]=sc.nextInt();
             sc.nextLine();
        }
        for(int k=0;k<n;k++)
        {
            int count=0;
            int i=-1;
            int num=0;
            while(a[k]+i <= b[k])
            {
                i++;
                String temp=new String();
                int alo=a[k]+i;
                temp=String.valueOf(alo);
                char[] abdo=temp.toCharArray();
                if(abdo.length<2)
                    break;
                else if(abdo.length ==2)
                {
                    char temp2=abdo[0];
                    abdo[0]=abdo[1];
                    abdo[1]=temp2;
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num > a[k]+i)
                        count++;
                    
                }
                else
                {
                   char[] temp5=abdo;
                    char temp2=abdo[0];
                    char temp3=abdo[1];
                    abdo[0]=abdo[2];
                   abdo[1]=temp2;
                   abdo[2]=temp3;
                    
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1])+String.valueOf(abdo[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num >a[k]+i)
                        count++;
                    
                  char[] abdo2=temp.toCharArray();
                      temp2=abdo2[0];
                     temp3=abdo2[2];
                    abdo2[0]=abdo2[1];
                    abdo2[1]=temp3;
                    abdo2[2]=temp2;
                    
                       aaa= String.valueOf(abdo2[0])+ String.valueOf(abdo2[1])+String.valueOf(abdo2[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num > a[k]+i)
                        count++;
                    
                }
                
               
            }
            System.out.format("Case #%d: %d\n", k+1, count);
        }
    }
    
}
