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 codejam;
import java.util.Hashtable;
public class RecycledNumbers {
	@SuppressWarnings("unchecked")
	Hashtable h1; 
	@SuppressWarnings("unchecked")
	RecycledNumbers(){
		h1 = new Hashtable();
	}
	@SuppressWarnings("unchecked")
	long noOfPairs(long min, long max, long num){
		String sMin = ""+min;
		String sMax = ""+max;
		String sNum = ""+num;
		
		long countPairs = 0;
		
		int nod = sMin.length();
		int i = 0;
		char fd = sNum.charAt(0);
		for( i = 1; i < nod ; i++){
			
			String block = sNum.substring(i);
			if( block.charAt(0)=='0' || (block.charAt(0)> sMax.charAt(0)) || block.charAt(0)<fd)
				continue;
			else if( block.charAt(0)== sMax.charAt(0)){
				int j = 2;
				boolean can = true;
				for( ; j<= block.length() ;j++){
					String sTemp = block.substring(0,j);
					long temp = Long.parseLong(sTemp);
					temp *= (long)Math.pow(10, nod - j);
					if( temp > max){
						can = false;
						break;
					}
				}
				if( !can ){
					continue;
				}
			}
			
			String sPair = block + sNum.substring(0,i);					
			long pair = Long.parseLong(sPair);
			boolean contains = h1.containsKey(sNum+" "+sPair);
			if( pair > num && pair<=max && !contains){
				h1.put(sNum+" "+sPair, countPairs);
				countPairs ++;
			}
			
		}
		return countPairs;
	}	
	public static void main(String[]args){
		long i = 0;
		long count = 0;
		RecycledNumbers r1 = new RecycledNumbers();
		
		FileRead fr = new FileRead("C-small-attempt0.in");
		FileWrite fw = new FileWrite("C-small-ouput.txt");
		//FileRead fr = new FileRead("C-large-attempt0.in");
		//FileWrite fw = new FileWrite("C-large-ouput.txt");
		
		int t = fr.readNextInt();
		int j = 0;
		long A,B;
		
		for( ; j< t; j++){
			count = 0;
			String nextLine = fr.readNextLine();
			A = Long.parseLong(nextLine.split(" ")[0]);
			B = Long.parseLong(nextLine.split(" ")[1]);
			for( i = A; i < B; i++){
				count += r1.noOfPairs(A,B,i);				
			}
			fw.writeLine("Case #"+(j+1)+": "+count);
		}		
		fr.close();
		fw.close();
	}
	
}
