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 cs224n.gcj;

import java.io.IOException;
import java.util.HashSet;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.FileInputStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.File;



public class ProbC {

	static int getNRecycledPair(int b, int B){
		
		String s = new Integer(b).toString();		
		int nDigits = s.length();
		
		String ls, rs;
		HashSet<Integer> validPairs = new HashSet<Integer>();
		
		for(int i = 1; i < nDigits; i++){
			ls = s.substring(0, i);
			rs = s.substring(i);
			int rotb = Integer.parseInt((rs+ls));
			if(rotb > b && rotb <= B)
				validPairs.add(rotb);				
		}
		return validPairs.size();
		
	}
	
	static public int getTotRecycledPair(int A, int B){
		
		int n = 0;
		for(int i = A; i <= B; i++){
			n += getNRecycledPair(i, B);
		}
		
		return n;
	}
	
	static public void main(String[] args) throws IOException{
		
		File inFile = new File(args[0]);
		File outFile = new File(args[1]);
		
		if(!inFile.exists())
			System.out.println("File Does Not Exist!");

		
		BufferedReader in = new BufferedReader( new InputStreamReader( new FileInputStream(inFile) ) );
		PrintWriter out = new PrintWriter( new FileWriter(args[1]), true );
		
		String line;
		line = in.readLine();
		int T = Integer.parseInt(line);
		for(int i = 1; i <= T; i++){
			
			line = in.readLine();
			String[] parts = line.split(" ");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			out.print("Case #"+i+": ");
			out.println( getTotRecycledPair(A,B) );
			
		}
		
		
		in.close();
		out.close();
		
		
	}
	
}
