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.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Eunice
 */
public class Recycled_Numbers {

    static Scanner scanner = new Scanner(System.in);
    static PrintWriter out;

    public static void main(String[] args) {

        try {
             out = new PrintWriter(new FileWriter("C:\\Users\\Eunice\\Desktop\\Code Jam\\CodeJam Outputs\\Recycled_Numbers.txt" ));
        }
        catch (Exception ex) {
            ex.printStackTrace();
        }

        int noTestCases = scanner.nextInt();
        for(int i = 0; i < noTestCases; i++) {
            int A = scanner.nextInt();
            int B = scanner.nextInt();
            int noRecycledPairs = 0;
            String valueOfA = String.valueOf(A);
            String valueOfB = String.valueOf(B);
            int noDigits = valueOfA.length();
            int[] possible = new int[(B - (A - 1))];
            for(int j = 0; j < (B - (A - 1)); j++) {
                possible[j] = A + j;
            }
            int n = 0;
            int m = 0;
            String valueOfn;
            String valueOfm;
            for(int l = 0; l < possible.length; l++) {
                n = possible[l];
                valueOfn = String.valueOf(n);
                for(int k = 0; k < possible.length; k++) {
                    m = possible[k];
                    valueOfm = String.valueOf(m);
                    if(k != l) {
                        if((A <= n) && (n < m) && (m <= B)) {
                            String s = valueOfn;
                            for(int p = 0; p < noDigits; p++) {
                                
                                s = s.charAt(s.length() - 1) + s.substring(0, (s.length() - 1));
                                if(s.equals(valueOfm)) {
                                    noRecycledPairs++;
                                    p = noDigits;
                                }
                            }
                        }
                    }
                }
            }
            
            System.out.println("Case #" + (i + 1) + ": " + noRecycledPairs);
//            out.close();
        }
    }
}
