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

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

import java.io.*;

/**
 *
 * @author wijebandara
 */
public class RecycledNumbers {
    public static void main(String[] args) throws FileNotFoundException, IOException {

        //java.io.BufferedReader in = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
        java.io.BufferedReader in=new java.io.BufferedReader(new java.io.FileReader("/home/wijebandara/Desktop/C-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("/home/wijebandara/Desktop/C-small-attempt0.out")));

        int n = Integer.parseInt(in.readLine());
        
        java.util.StringTokenizer st ;
        for(int i=0;i<n;i++)
        {
            st=new java.util.StringTokenizer(in.readLine());
            
            int a=Integer.parseInt(st.nextToken());
            int b=Integer.parseInt(st.nextToken());
            int ans=0;
            for(int j=a;j<=b;j++)
            {
                java.util.ArrayList <Integer> l =new java.util.ArrayList<Integer>();
                int h =(int)Math.log10(j);
                for(int k=1;k<=h;k++)
                {
                    int p=change(j,k);
                    if(p>j && !l.contains(p) && p>=a && p<=b)
                    {
                        l.add(p);
                        ans++;
                    }
                }
            }
            System.out.print("Case #" + (i + 1) + ": ");
            out.print("Case #" + (i + 1) + ": ");
            System.out.println(ans);
            out.println(ans);
        }
        out.close();
    }
    static int change(int x,int n)
    {
        int a=(int)(Math.pow(10, n));
        int hold=x%a;

        int b =(int)Math.log10(x)+1;
        x=(x-hold)/a;

        return hold*(int)Math.pow(10, b-n)+x;
    } 
}
