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

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
	static final int MAX = 3000;
	static Set<Integer> dic[] = new HashSet[MAX];

	public static void main(String[] args) {
		for (int i = 1; i < MAX; i++) {
			dic[i] = new HashSet<Integer>();
			String s = i + "";
			for (int j = 1; j < s.length(); j++) {
				String a = s.substring(0, j);
				String b = s.substring(j);
				String c = b + a;
				if (c.charAt(0) == '0') {
					continue;
				}
				int p = Integer.parseInt(c);
				if (p > i) {
					dic[i].add(p);
				}
			}
		}
		try {
			Scanner scanner = new Scanner(System.in);
			int lp = scanner.nextInt();
			for (int loop = 0; loop < lp; loop++) {
				int ans = 0;
				int A = scanner.nextInt();
				int B = scanner.nextInt();
				for (int i = A; i < B; i++) {
					for (Integer j : dic[i]) {
						if (j <= B) {
							ans++;
						}
					}
				}
				System.out.println("Case #" + (loop + 1) + ": " + ans);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
