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.*;
import java.util.HashSet;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new FileReader(new File("C-small-attempt1.in")));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("C-small-attempt1.out")));

		int T = Integer.parseInt(bf.readLine());
		for (int c = 0; c < T; c++) {
			HashSet<String> set = new HashSet<String>();

			String tokens[] = bf.readLine().split(" ");
			int A = Integer.parseInt(tokens[0]), B = Integer.parseInt(tokens[1]), ans = 0;
			for (int I = A; I < B; I++) {
				String i = I + "";
				for (int j = 1; j < i.length(); j++) {
					String re = i.substring(j) + i.substring(0, j);
					if (I < Integer.parseInt(re) && Integer.parseInt(re) <= B) {
						if (!set.contains(i + "-" + re)) ans++;
						
						set.add(i + "-" + re);
					}
				}
			}
			bw.write(String.format("Case #%d: %d\n", c + 1, ans));
		}
		bw.close();
	}
}
