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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class ProblemB {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(new File("/Users/phan/Downloads/C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter("/Users/phan/Downloads/output");
		int t = scanner.nextInt();
		
		for (int i = 1; i <= t; i++) {
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			
			int cnt = 0;
			
			for (int n = A; n <= B; n++) {
				int[] digits = new int[7];
				int tmp = n;
				int cntdigit = 0;
				while (tmp > 0) {
					digits[cntdigit++] = tmp % 10;
					tmp = tmp / 10;
				}
				
				int[] mm = new int[cntdigit];
				int cnt2 = 0;
				for (int j = 1; j < cntdigit; j++) {
					int m = 0;
					for (int k = j - 1; k >= 0; k--) 
						m = m * 10 + digits[k];
					for (int k = cntdigit - 1; k >= j; k--) 
						m = m * 10 + digits[k];
					
					if ( (n < m) && (m <= B) ) {
						
						boolean b = true;
					
						for (int l = 0; l < cnt2; l++)
							if (mm[l] == m)
								b = false;
						
						if (b) {
							cnt++;
							mm[cnt2++] = m;
							//System.out.println(n + " " + m);
						}
					}
					
				}

			}
			
			pw.println("Case #" + String.valueOf(i) + ": " + String.valueOf(cnt));
		}
		
		scanner.close();
		pw.close();

	}

}
