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.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;


public class Recycled {

	public static String shift(String x){
		return (x.substring(x.length() - 1) + x.substring(0, x.length() - 1));
	}
	
	public static void main(String[] args) {
		
		int t, x = 1;
		String a, b, s;
		Scanner scan = new Scanner(System.in);
		
		t = scan.nextInt();
		
		for(int i=0; i<t; i++){
			
			a = scan.next();
			b = scan.next();
			
			ArrayList<String> al = new ArrayList<String>();
			
			int n = Integer.parseInt(a);
			
			while(n <= Integer.parseInt(b)){
				
				s = "" + n;
				String orig = ""+n;
				
				for(int j=0; j<a.length() - 1; j++){
					
					s = shift(s);
					if(s.equals(orig)) break;
					
					//System.out.println(s);
					
					if(Integer.parseInt(s) >= Integer.parseInt(orig) && Integer.parseInt(s) <= Integer.parseInt(b) && !al.contains(s)){
						al.add(orig+"-"+s);
					}
				}
				
				n++;
			}
			
	//		for(int j=0; j<al.size(); j++)
	//			System.out.println(al.get(j));
			
			System.out.println("Case #" + x + ": " + al.size());
			x++;
		}
		
	}

}
