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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class C {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
		FileWriter fw = new FileWriter("A-small.out");
		int N = new Integer(in.readLine());
		for (int cases = 1; cases <= N; cases++) {
			StringTokenizer st = new StringTokenizer(in.readLine());
			int A = new Integer(st.nextToken());
			int B = new Integer(st.nextToken());

			fw.write("Case #" + cases + ": " + nrecycled(A, B) + "\n");
		}
		fw.flush();
		fw.close();
	}

	private static int nrecycled(int a, int b) {
		int cpt = 0;
		for (int i = a; i < b; i++) {
			TreeSet<Integer> l = listRecycled(i);
			for(Integer x:l) {
				if ((i<x)&&(x<=b)) cpt++;
			}
		}
		return cpt;
	}

	private static TreeSet<Integer> listRecycled(int n) {
		TreeSet<Integer> l = new TreeSet<Integer>();
		int nbChiffres = Integer.toString(n).length();
		for(int i=1; i<nbChiffres; i++) {
			int expr = (int)Math.pow(10, i);
			int expl = (int)Math.pow(10, nbChiffres-i);
			int first = (n % expr) / (int)Math.pow(10, i-1);
			if (first!=0) {
				int nrotate = (n % expr)*expl + (n/expr);
				l.add(new Integer(nrotate));
			}
		}
		return l;
	}

}
