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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumber {

	/**
	 * @param args
	 * @throws IOException
	 * @throws NumberFormatException
	 */
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		// TODO Auto-generated method stub

		FileInputStream fstream = new FileInputStream("C:\\input.txt");
		DataInputStream in = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));

		int cases = Integer.parseInt(br.readLine());
		String mainOutput = "";

		for (int c = 0; c < cases; c++) {

			StringTokenizer stringTokenizer = new StringTokenizer(br.readLine());

			int a = Integer.parseInt(stringTokenizer.nextToken());
			int b = Integer.parseInt(stringTokenizer.nextToken());
			
			int finalCount = 0;

			int arr[] = new int[b * 2];
			int arr2[] = new int[b * 2];

			for (int n = a; n < b; n++) {

				int TEN = 10;
				int count = Integer.toString(n).length();
				for (int i = 1; i < count; i++) {
					int m = (int) ((n % Math.pow(TEN, i)) * Math.pow(TEN, count
							- i))
							+ (int) (n / Math.pow(TEN, i));
					if (a <= n && n < m && m <= b) {
						// System.out.println(n + " " + m);
						arr[finalCount] = m;
						arr2[finalCount++] = n;
					}
				}
			}
			int count = 0;
			for (int i = 1; i < finalCount; i++) {
				if ((arr2[i] == arr2[i + 1] && arr[i] == arr[i + 1])
						|| (arr2[i - 1] == arr2[i] && arr[i - 1] == arr[i])) {
					count++;
				}
			}
			mainOutput = mainOutput + "Case #"+(c+1)+": "+(finalCount - (count / 2))+"\n";			
		}
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File(
        "C:\\output.txt"), true));
		
		bw.write(mainOutput);
		bw.close();
		
		
		in.close();
	}

}
