import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

package qualifyingRound;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class RecycledNumbers 
{
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int i = 1;
		while (in.hasNextLine())
		{	
			System.out.print("Case #" + i + ": ");
			int low = in.nextInt();
			int high = in.nextInt();
			int count = 0;
			for (int c = low; c < high; c++)
			{	
//				int temp = computePermutations(c,high);
//				System.out.println(c + " " + temp);
//				count+=temp;
				count += computePermutations(c,high);
			}
			System.out.println(count);
			i = i+1;
		}
//		System.out.println(computePermutations(2212,2222));
	}
	private static int computePermutations (int low, int high)
	{
		String str = "" + low;
		int length = str.length();
		int count = 0;
		int temp = low;
		for (int i = 0; i < length; i++)
		{
			int last = temp % 10;
			temp = temp/10 + last * pow10(length - 1);
//			System.out.println(low + " " + temp);
			if (temp > low && temp <= high)
			{
//				System.out.println(low + " " + temp);
				count++;
			}
		}
		return count;
		
	}
	private static int pow10 (int pow)
	{
		int toReturn = 1;
		for (int i = 0; i < pow; i++)
		{
			toReturn *= 10;
		}
		return toReturn;
	}
}
