import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}


import java.io.*;
import java.util.HashSet;

public class code33 {
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        FileWriter fos = new FileWriter("outfile",false);
        BufferedWriter bw = new BufferedWriter(fos);
        int T=Integer.parseInt(br.readLine()), A , B , j ,i ;
        String str[];
        for(j=1;j<=T; j++)
        {
            str=br.readLine().split(" ");
            A= Integer.parseInt(str[0]); B=  Integer.parseInt(str[1]);
            
            bw.write("Case #"+j+": "+swapncal(A, B)+"\n");
        }
        bw.close();
        
        
    }
    public static int swapncal(int A,int B)
    {
        int n=0, p ,num; 
        String xs; 
        HashSet<Integer> set = new HashSet<Integer>();
        for (int x= A; x <=(A+B); x++)
            {
                set.clear();
                xs=x+"";
                for(p=1;p< xs.length();p++)
                {
                    num=Integer.parseInt(xs.substring(p)+xs.substring(0, p));
                    if( num > x && !set.contains(num) && num >=A && num <=B)
                    {
                        set.add(num);
                        n++;
                    }
                }
                
            }
        return n;
    }
}