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 twentytwelve.qualification.c;

import java.util.Scanner;

public final class RecycledNumbers {

    /**
     * @param args
     */
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int cases = sc.nextInt();
	for (int no = 1; no <= cases; no++) {
	    System.out.print("Case #" + no + ": ");
	    int A = sc.nextInt();
	    int B = sc.nextInt();

	    int pairs = 0;

	    int Adigits = 1;
	    int setSize = 0;
	    while (A >= 10 * Adigits) {
		Adigits *= 10;
		setSize++;
	    }
	    int[] currentSet = new int[setSize];

	    for (int current = A; current <= B; current++) {
		int bdigits = 10;
		int udigits = Adigits;
		for (int i = 0; udigits > 1; bdigits *= 10, udigits /= 10) {
		    int recycled = current / bdigits + (current % bdigits) * udigits;
		    if (recycled > current && recycled <= B) {
			boolean found = false;
			for (int j = 0; j < i; j++) {
			    if (currentSet[j] == recycled) {
				found = true;
			    }
			}
			if (!found) {
			    // System.out.println(current + " -> " + recycled);
			    currentSet[i++] = recycled;
			    pairs++;
			}
		    }
		}
	    }
	    System.out.println(pairs);
	}
    }
}
