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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;


public class RN {
	public static void main(String[] args) throws Exception 
	{
		new RN().run();
	}
	
	void run() throws Exception 
	{	
		Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("CSmall.out"));
		
		int ntest = sc.nextInt();
		sc.nextLine();
	
		for(int test=1;test<=ntest;++test) 
		{
			String s = sc.nextLine();			
			String ss[] = s.split(" ");			
			int min = Integer.parseInt(ss[0]);
			int max = Integer.parseInt(ss[1]);	
			int count = num(min);	
			int cres = 1;
			int r = 0;
			String sres = "";
			int flag[] = new int[2000000];			
			for(int i=min;i<=max;i++){
				for(int j = 1; j<count;j++){	
					if(flag[i]==0){							
						sres = reverse(String.valueOf(i),j);	
						if(flag[Integer.parseInt(sres)]!=1 && Integer.parseInt(sres)!=i && min<=Integer.parseInt(sres) && Integer.parseInt(sres)<=max){							
							flag[Integer.parseInt(sres)] = 1;
							cres++;	
						}	
					}
				}
				flag[i]=1;
				r += cres*(cres-1)/2;
				cres = 1;
			}
			pw.print("Case #" + test + ": " + r);			
			pw.println();	
		}
		pw.close();
		sc.close();	
	}
	
	public String reverse(String s, int i){
		String s0 = s.substring(0,i);
		String s1 = s.substring(i,s.length());
		StringBuilder sb0 = new StringBuilder(s0);
		StringBuilder sb1 = new StringBuilder(s1);
		StringBuilder res = new StringBuilder((sb0.reverse().toString()+sb1.reverse().toString()));
		return res.reverse().toString();
	}
	
	public int num(int a){
		int count = 1;
		while(a/10!=0){
			a = a/10;
			count++;
		}
		return count;
	}
	
}
