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 CaseSolvers;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

import Controller.IO;

public class WiresCase extends CaseSolver {

	private ArrayList<Short[]> lines;
	private int numOfIntersections;

	public WiresCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void initializeVars() {
		lines = new ArrayList<Short[]>();
	}

	@Override
	public void addLine(String line) {
		String[] tmp = line.split(" ");
		Short[] tmp2 = { Short.parseShort(tmp[0]), Short.parseShort(tmp[1]) };
		this.lines.add(tmp2);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + numOfIntersections);
	}

	@Override
	public CaseSolver process() {
		Collections.sort(lines, new Comparator<Short[]>() {
			@Override
			public int compare(Short[] o1, Short[] o2) {
				return o1[0] - o2[0];
			}
		});
		//printList();


		for (int i = 0; i < lines.size(); i++) {
			for (int j = i + 1; j < lines.size(); j++) {
				if (lines.get(i)[1] > lines.get(j)[1]) {
					numOfIntersections++;
				}
			}
		}

		return this;
	}

	private void printList() {
		for (Short[] a : lines) {
			System.err.println(Arrays.deepToString(a));
		}
	}
}