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.util.Scanner;


public class Shift {
	public static void main(String[] args) {
		int a,b,c,d=10,e=0,x,T,j;
		int inf,sup,res=0;
		Scanner l = new Scanner(System.in);
		T=l.nextInt();
		for(j=0;j<T;j++){
			inf=l.nextInt();
			sup=l.nextInt();	
			res=0;
			for(int k=inf;k<=sup;k++){
				x=k;
				int vixi=k;
				c=0;
				e=0;
				while(vixi>0){
					vixi=vixi/10;
					e++;		
				}
				for(int i=0;i<e&&c!=k;i++){
					a=x%d;
					b=x/d;
					c= (a*(int)Math.pow(10, e-1)+b);
					if((c>k)&&(c<=sup)&&(c>=inf))
						res++;
					//System.out.println(c);
					x=c;
				}
			}
			System.out.println("Case #"+(j+1)+": "+res);
		}
	
	}
}
