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.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;


public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        if(args.length != 1) {
            return;
        }
        FileInputStream inputStream = new FileInputStream(args[0]);
        InputStreamReader istReader = new InputStreamReader(inputStream);
        BufferedReader buffReader = new BufferedReader(istReader);

        // T:åé¡æ°
        String tStr = buffReader.readLine();
        int t = Integer.valueOf(tStr);

        for(int i = 1; i <= t; i++) {
            StringBuilder caseBuilder = new StringBuilder("Case #");
            caseBuilder.append(i);
            caseBuilder.append(": ");

            // A and B:åé¡
            String abStr = buffReader.readLine();
            String[] aandbStrs = abStr.split(" ");
            int a = Integer.valueOf(aandbStrs[0]);
            int b = Integer.valueOf(aandbStrs[1]);

            int y = 0;
            for(int n = a; n < b; n++) {
                String nStr = String.valueOf(n);

                int[] ms = new int[nStr.length() - 1];
                for(int k = 1; k < nStr.length(); k++) {
                    String mStr = nStr.substring(nStr.length() - k).concat(nStr.substring(0, nStr.length() - k));

                    int m = Integer.valueOf(mStr);
                    if(m <= a || b < m || m <= n)
                        continue;

                    boolean already = false;
                    for(int j = 0; j < nStr.length() - 1; j++) {
                        if(m == ms[j]) {
                            already = true;
                            break;
                        }
                    }
                    if(!already) {
                        y++;
                        ms[k - 1] = m;
                    }
                }
            }

            caseBuilder.append(y);

            System.out.print(caseBuilder.toString());
            if(i != t)
                System.out.println();
        }
    }

}
