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

public class recycled {
    public static void main(String args[]) {
	java.util.Scanner s = new java.util.Scanner(System.in);
	int T = s.nextInt();
	for (int n = 1; n <= T; n++) 
	    System.out.println("Case #" + n + ": " + f(s.nextInt(), s.nextInt()));
    }

    public static int f(int a, int b) {
	String A = "" + a;
	String B = "" + b;
	java.util.HashSet<String> s = new java.util.HashSet<String>();

	for (int i = a; i <= b; i++) {
	    String I = "" + i;
	    for (int j = 1; j < I.length(); j++) {
		String x = I.substring(j) + I.substring(0, j);
		if (A.compareTo(x) <= 0 && B.compareTo(x) >= 0 && !I.equals(x))
		    if (x.compareTo(I) > 0) 
			s.add(x+":"+I);
		    else
			s.add(I+":"+x);
	    }
	}

	return s.size();
    }
}