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.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class NumberMagic {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.small"));
		int cases = Integer.parseInt(in.readLine());
		String [] tests = new String[cases];
		Set set = new HashSet<String>();
		for(int i=0;i<cases;i++){
			set.clear();
			tests[i] = in.readLine();
			int A = Integer.parseInt(tests[i].split(" ")[0]);
			int B = Integer.parseInt(tests[i].split(" ")[1]);
			
			for(int j=A;j<=B;j++){
                 for(int k=j+1;k<=B;k++){
                	 String s1 = Integer.toString(j);
                	 String s2 = Integer.toString(k);
                	 if(s2.length()!=s1.length() && s1.equalsIgnoreCase(s2)){
                		 continue;
                	 }
              		 if((s1 = s1.concat(s1)).contains(s2)){
                        set.add(s1+" "+s2);
              		 }                		    
                 }
			}
			System.out.println("Case #"+(i+1)+": "+set.size());
		}
	}

}
