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


public class Prob3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		
		int num = scan.nextInt();
		scan.nextLine();
		for(int i=0;i<num;i++){
			System.out.println("Case #" + (i+1) + ": " + eval(scan));
			scan.nextLine();
		}
	}
	
	private static int eval(Scanner scan){
		int A = scan.nextInt();
		int B = scan.nextInt();
		int sum = 0;
		
		for(int i=A;i<=B;i++){
			sum += pairsFor(i, A, B);
		}
		
		return sum;
	}
	
	private static int pairsFor(int n, int A, int B){
		int res = 0;
		int length = ("" + n).length() - 1;
		int mod;
		int m = n;
		//System.out.println("n: " + m);
		
		ArrayList<Integer> d = new ArrayList<Integer>(length);
		
		for(int i=0;i<length;i++){
			mod = m%10;
			m = (int)Math.floor(m/10.0) + mod*(int)Math.pow(10, length);
		
			//System.out.println("o: " + m);
			if(m > n && m <= B && m >= A && mod != 0 && !d.contains(m)){
				//System.out.println("n: " + n + " m: " + m);
				d.add(m);
				res++;
			}
		}
		
		return res;
	}

}
