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

import java.io.File;
import java.io.FileNotFoundException;

/**
 *
 * @author Fidel
 */
public class qr_problemB {
    public static void main(String args[]) throws FileNotFoundException{
        File f = new File("input.txt");
        java.util.Scanner sc = new java.util.Scanner(f);
        int T = sc.nextInt();
        
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int y = 0;
            
            for (int j = A; j <= B; j++) {
                for (int k = B; k > j; k--) {
                    String a = String.valueOf(j);
                    for (int l = 1; l < String.valueOf(k).length(); l++) {
                        String b = String.valueOf(k);
                        String tmp = b.substring(b.length()-l) + b.substring(0, b.length()-l);
                        
                        if(tmp.matches(a)){
                          
                            y++;
                            break;
                        }                        
                    }
                    
                }
            }
            System.out.println("Case #" + (i+1) + ": " + y);
        }
    }
}
