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

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import java.io.File;
import java.io.PrintWriter;

public class C {

	
	public static void main(String args[]){
		
		try{
		File ifile = new File(args[0]);
		File ofile = new File(args[1]);

		//Scanner in = new Scanner(System.in);
		//PrintWriter out = new PrintWriter(System.out);
		Scanner in = new Scanner(ifile);
		PrintWriter out = new PrintWriter(ofile);
		
		int T = in.nextInt();
		Set<Integer> set = null; 
		for(int ti=0;ti<T;ti++){
			int A = in.nextInt();
			int B = in.nextInt();
			
			int no_of_digits =0,counter=0 ;
			int a= A;
			while(a>0){
				no_of_digits++;
				counter++;
				a=a/10;
			}
			
			int res=0;
			int n= A;
			int m=0;
			
			while(n<=B){
				counter = no_of_digits-1;
				m=n;
				set = new HashSet<Integer>();
				while(counter>0){
					m = (int) ((m%10)*Math.pow(10,no_of_digits-1) + (m/10));
					if(A<=n && n<m && m <=B) {
						if(set.add(m)){
							res++;
							//out.println(n+":"+m + " Set:"+set);
						}
					}	
					counter--;//
				}
				set = null;
				n++; //increment n
			}
			
			out.format("Case #%d: %d\n", ti+1, res);

		}
		out.flush();
		in.close();
		out.close();	
		}catch(Exception e){e.printStackTrace();}
	}
}
