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.*;
import java.util.*;

public class RecycledNumbers
{
	public static void main(String[] args)throws Exception
	{
		File f = new File("recyclednumbers.txt");
		File outp = new File("recyclednumbers.out");
		Scanner sc = new Scanner(new FileReader(f));
		Writer wr = new BufferedWriter(new FileWriter(outp));
		int t = sc.nextInt();
		for(int casse=1; casse<=t; casse++)
		{
			String as = sc.next(), bs = sc.next();
			int a = Integer.parseInt(as), b = Integer.parseInt(bs);
			boolean[][] check = new boolean[b-a+1][b-a+1];
			int digits = (int) (Math.ceil(Math.log10(b)));
			for(int i=a; i<=b; i++)
			{
				String temp1 = new Integer(i).toString();
				//StringBuffer temp1 = new StringBuffer(s);
				int start=0;
				for(int j=1; j<=digits; j++)
				{
					StringBuffer temp2 = new StringBuffer(temp1.length());
					int count = 1;
					for(int k=start; count<=digits; count++, k=(k+1)%digits)
						temp2.append(temp1.charAt(k));
					start++;
					if(temp2.charAt(0)=='0')
						continue;
					int n1 = Integer.parseInt(temp1.toString());
					int n2 = Integer.parseInt(temp2.toString());
					if(a<=n2 && n2<=b)
						check[n1-a][n2-a] = check[n2-a][n1-a] = true;
				}
			}
			int count = 0;
			for(int i=0; i<check.length; i++)
				for(int j=i+1; j<check[i].length; j++)
					if(check[i][j])
						count++;
			wr.write("Case #"+casse+": "+count+"\n");
		}
		sc.close();
		wr.close();
		return;
	}
}