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();
	}
}

package quali2012;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

import javax.swing.plaf.basic.BasicBorders.SplitPaneBorder;

public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		for (int testcase = 1; testcase <= T; testcase++) {
			int A = in.nextInt();
			int B = in.nextInt();
			//System.out.println("["+A + " " + B+"]");
			int answer = 0;
			List<Integer> found = new ArrayList<Integer>();
			for (int i = A; i <= B; i++) {
				for (int j = A; j <= B; j++) {
					if (i < j) {
						for (int k = 1; k < String.valueOf(A).length(); k++) {
							int a, b1;
							String b;
							
							a = recycleNumber(j, k);
							b =  debugsplit(j, k);
							b1 = i;

							if (a == b1) {
								answer += 1;
								//System.out.println(j + " " + b1+ " ["+b+"]");
								
							}
						}
					}
				}

			}
			System.out.format("Case #%d: %s\n", testcase, answer);
		}

	}

	private static int recycleNumber(int num, int pos) {
		String input = String.valueOf(num);
		String subA, subB;

		subA = input.substring(0, pos);
		subB = input.substring(pos);

		/*if(subA == subB){
			return 0;
		}*/
		int result = Integer.parseInt(subB + subA);
		return result;
	}
	private static String debugsplit(int num, int pos) {
		String input = String.valueOf(num);
		String subA, subB;

		subA = input.substring(0, pos);
		subB = input.substring(pos);

		/*if(subA == subB){
			return "";
		}*/
		String result = subA +" "+ subB;
		return result;
	}

}
