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

public class RecycledNumbers {

	public static void main(String[] args) throws IOException {

		File file = new File("in.txt");
		Scanner scanner = new Scanner(file);
		FileWriter outFile = new FileWriter("out.txt");
		PrintWriter out = new PrintWriter(outFile);

		int N = scanner.nextInt();
		for (int i = 0; i < N; i++) {

			int A = scanner.nextInt();
			int B = scanner.nextInt();
			Set<String> set = new HashSet<String>();

			for (int n = A; n <= B; n++) {

				char[] c = Integer.toString(n).toCharArray();

				for (int k = 0; k < c.length - 1; k++) {

					char temp = c[c.length - 1];
					for (int l = c.length - 1; l > 0; l--) {
						c[l] = c[l - 1];
					}
					c[0] = temp;

					StringBuilder s = new StringBuilder();
					for (int l = 0; l < c.length; l++) {
						s.append(c[l]);
					}

					String m = s.toString();

					if (A <= Integer.parseInt(m) && Integer.parseInt(m) <= B
							&& n < Integer.parseInt(m)) {
						set.add(Integer.toString(n).concat(m));
					}

				}

			}

			out.println("Case #" + (i + 1) + ": " + set.size());

		}

		out.close();

	}
}
