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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class RecycledNumbers 
{
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int i = 1;
		while (in.hasNextLine())
		{	
			System.out.print("Case #" + i + ": ");
			int low = in.nextInt();
			int high = in.nextInt();
			int count = 0;
			for (int c = low; c < high; c++)
			{	
//				int temp = computePermutations(c,high);
//				System.out.println(c + " " + temp);
//				count+=temp;
				count += computePermutations(c,high);
			}
			System.out.println(count);
			i = i+1;
		}
//		System.out.println(computePermutations(2212,2222));
	}
	private static int computePermutations (int low, int high)
	{
		String str = "" + low;
		int length = str.length();
		int count = 0;
		int temp = low;
		for (int i = 0; i < length; i++)
		{
			int last = temp % 10;
			temp = temp/10 + last * pow10(length - 1);
//			System.out.println(low + " " + temp);
			if (temp > low && temp <= high)
			{
//				System.out.println(low + " " + temp);
				count++;
			}
		}
		return count;
		
	}
	private static int pow10 (int pow)
	{
		int toReturn = 1;
		for (int i = 0; i < pow; i++)
		{
			toReturn *= 10;
		}
		return toReturn;
	}
}
