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.*;
public class permute 
{
	static LinkedList<Integer>[] build;	
	public static void Permute()
	{
		build = new LinkedList[1001];
		for(int i=1 ; i<=1000 ; i++)
		{
			build[i] = new LinkedList();
			String str = new String(i+"");
			for(int j=0 ; j<str.length() ; j++)
			{
				char s2 = str.charAt(0);
				str = str+s2;
				str = str.substring(1);
				int num = new Integer(str);
				if(num>i && !build[i].contains(num))	build[i].add(num);
			}
		}
	}
	public static void main(String[] args) 
	{
		Scanner scan = new Scanner(System.in);
		Permute();
		int cnt = scan.nextInt();
		for(int c=1 ; c<=cnt ; c++)
		{
			int start = scan.nextInt(),end = scan.nextInt(),res = 0;
			for(int i=start ; i<=end ; i++)
				for(int j=0 ; j<build[i].size() ; j++)
					if(build[i].get(j)<=end)
						res ++;
			System.out.println("Case #"+c+": "+res);
		}
		
	}
}
