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.util.Scanner;


public class Recycle {
	public static void main(String args[])
	{		
		int t;
		int save[] = new int[50];
		Scanner kb = new Scanner(System.in);
		t = kb.nextInt();
		int a,b;
		for(int i=0;i<t;i++)
		{
			a = kb.nextInt();
			b = kb.nextInt();
			int change = 0;
			int count = 0;
			System.out.print("Case #"+(i+1)+": ");
			
			for(int j=a;j<=b;j++)
			{
				
				String s = Integer.toString(j); 
				int x=0;
				for(int start=1;start<s.length();start++)
				{
					int max=0;
					change = 0;
					for(int k=start-1;max<s.length();max++,k--)
					{
						if(k<0) k = s.length()-1;
						change = change + (s.charAt(k)-'0')*((int)Math.pow(10,max));
						if(max==s.length()-1)
						{
							save[x++] = change;
						}
						
					}
					if(change<=b && change>=a && change!=j && change>j) 
					{
						int point=0;
						for(int y=0;y<x-1;y++)
						{
							if(save[y]==change) 
							{
								point=1;
								break;
							}
						}
						if(point==0)
						{	
							count++;
						}
					}
				}
			}
			System.out.println(count);
		}
		
	}
}
