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.PrintWriter;
import java.util.*;
import java.util.jar.JarEntry;

/**
 * Created with IntelliJ IDEA.
 * User: vitaly
 * Date: 4/14/12
 * Time: 9:24 AM
 * To change this template use File | Settings | File Templates.
 */
public class Main {

    public static int bruteForce(int start, int end) {
        Set<String> set = new HashSet<String>();
        for (int k = start; k <= end; k++) {
            String repr = Integer.toString(k);
            for (int i = 1; i < repr.length(); i++) {
                String a = repr.substring(0, i);
                String b = repr.substring(i, repr.length());
                int comb = Integer.valueOf(b + a);
                if (comb > k & comb >= start && comb <= end) {
                    String c = "" + k + ":" + comb;
                    set.add(c);
                }
            }
        }
        return set.size();
    }

    public static void main(String[] args) throws Exception {

        Scanner scanner = new Scanner(new File("C-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new File("google.out"));

        int n = scanner.nextInt();
        for(int i = 0; i < n; i++) {
            int start = scanner.nextInt();
            int end = scanner.nextInt();
            int comb = bruteForce(start, end);
            pw.print(String.format("Case #%d: %d%n", i + 1, comb));
        }


        scanner.close();
        pw.close();


    }

}
