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.Scanner;

public class Problem3 {
    public static void main(String[] args) {
        try {
            Scanner inputReader = new Scanner(new File("S:\\input.in"));
            int inputCases = inputReader.nextInt();
            PrintWriter outputWriter = new PrintWriter("S:\\output.in");
            for (int currentInputCase = 0; currentInputCase < inputCases; currentInputCase++) {
                String markUpString = "";
                int milestone = 0;
                int firstA = inputReader.nextInt();
                int secondB = inputReader.nextInt();
                for (int currentN = firstA; currentN < secondB; currentN++) {
                    String n = currentN + "";
                    for (int i = 1; i <= n.length() - 1; i++) {
                        String trimString = n.substring(n.length() - i, n.length()) + n.substring(0, n.length() - i);
                        if (!trimString.startsWith("0")) {
                            if (!n.equals(trimString)) {
                                int trimmedInt = Integer.parseInt(trimString);
                                if (trimmedInt <= secondB && trimmedInt > (Integer.parseInt(n))) {
                                    if (!markUpString.contains(n + "#" + trimString)) {
                                        markUpString += (n + "#" + trimString + ",");
                                        milestone++;
                                    }
                                }
                            }
                        }
                    }
                }
                outputWriter.write("Case #" + (currentInputCase + 1) + ": " + milestone + "\n");
            }
            outputWriter.flush();
            outputWriter.close();
        } catch (Exception e) {

        }
    }

}
