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


public class ProblemC {
	public static void main(String args[]){
		Scanner scanner = new Scanner(System.in);
		int noTestCases = Integer.parseInt(scanner.nextLine());
		
		for(int i=0;i<noTestCases;i++){
			String inputString = scanner.nextLine();
			String[] temp;
			temp = inputString.split(" ");
			int A = Integer.parseInt(temp[0]);
			int B = Integer.parseInt(temp[1]);
			
			int count = 0;
			for(int n=A;n<B;n++){
				for(int m=n+1;m<=B;m++){
					//System.out.println("n="+n +"m="+m);
					String N = Integer.toString(n);
					String M = Integer.toString(m);
					StringBuffer NN = new StringBuffer(N);
					NN = NN.append(N);
					N = NN.toString();
					if(N.contains(M)){
						count++;
					}
					
				}
			}
			System.out.println("Case #"+(i+1)+": "+count);
			
		}
	}
}
