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.FileReader;
import java.io.IOException;
import java.util.Arrays;

public class Csmall {
    
    private static String move(String n) {
        return n.substring(1) + n.charAt(0);
    }
    
    private static boolean recycled(int n, int m) {
        // Parte 1
        char[] cn = (n + "").toCharArray();
        char[] cm = (m + "").toCharArray();
        Arrays.sort(cn);
        Arrays.sort(cm);
        
        if (!Arrays.equals(cn, cm))
            return false;
        
        // Parte 2
        String cpy = n + "";
        
        while (!(cpy = move(cpy)).equals(n + ""))
            if (Integer.parseInt(cpy) == m)
                return true;
        
        return false;
    }
    
    public static void main(String[] args) {
        BufferedReader br = null;

        try {
            br = new BufferedReader(new FileReader(args[0]));
            
            int s = Integer.parseInt(br.readLine());
            
            for (int i = 0; i != s; ++i) {
                String x = br.readLine();
                String[] tokens = x.split(" ");
                
                int A = Integer.parseInt(tokens[0]);
                int B = Integer.parseInt(tokens[1]);
                int count = 0;
                
                System.out.print("Case #" + (i+1) + ": ");
                
                for (int n = A; n <= B; ++n)
                    for (int m = n + 1; m <= B; ++m)
                        if (recycled(n,m))
                            ++count;
                
                System.out.println(count);
            }

        } catch (IOException e) {
            System.out.println("Error :(");
        } finally {
            
            try {
                if (br != null) br.close();
            } catch (IOException ex) {
                System.out.println("Error :(");
            }
            
        }
    }
}