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.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Created by IntelliJ IDEA.
 * User: nickg
 * Date: 4/13/12
 * Time: 9:57 PM
 * To change this template use File | Settings | File Templates.
 */
public class CodeJamThree {
    public static int numNumbers(int a, int b){
        int digits = (int) Math.log10(b);
        digits++;
        Set<Integer> seen = new HashSet<Integer>();
        int total = 0;
        for(int x = a; x < b; x++){
            int pow = 10;
            seen.clear();
            for(int y = 1; y < digits; y++){
                int moved = move(x, pow);
                pow*= 10;
                if(moved <= b && moved > x)
                    seen.add(moved);
            }
            total+= seen.size();
        }
        return total;
    }

    public static int move(int src, int pow){
        int smallPart = src / pow;
        int bigPart = src % pow;
        int factor =  (int) Math.log10(smallPart) + 1;
        pow = (int) Math.pow(10, factor);
        return bigPart * pow + smallPart;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int numTrials = scanner.nextInt();
        for(int i = 0; i < numTrials; i++){
            int i1 = numNumbers(scanner.nextInt(), scanner.nextInt());
            System.out.println("Case #" + (i+1) + ": " + i1);
        }
    }
}
