import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.awt.datatransfer.StringSelection;
import java.util.*;
public class q3 {

	public static void main(String[] args) {
		new q3().run();
	}
	Scanner input = new Scanner(System.in);
	void run(){
		int c = input.nextInt();
		for(int i=1;i<=c;i++){
			System.out.print("Case #"+i+": ");
			solve();
		}
	}
	void solve(){
		int a = input.nextInt();
		int b = input.nextInt();
		boolean [] used = new boolean [b+1];
		int ans = 0;
		String x;
		int i,j,k,y;
		for(i=a;i<=b;i++){
			x = Integer.toString(i);;
			for(j=1;j<=x.length()-1;j++){
				y = recycled(x,j);
				//System.out.println(y);
				if(y >= a && y <= b && !used[y] && i!=y){
					//System.out.println(i +" "+y);
					ans++;
				}
			}
			used[i] = true;
		}	
		System.out.println(ans);
	}
	int recycled(String x,int n){
		String f = x.substring(x.length()-n,x.length());
		int i;
		for(i=0;i<f.length() && f.charAt(i) == '0';i++)
		f = f.substring(i+1,f.length());
		String l = x.substring(0,x.length()-n);
		f = f.concat(l);
		return Integer.parseInt(f);
	}

}
