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.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.TreeSet;

public class C_Recylce
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File("./data/C-small-attempt0.in")));
		long casos = Integer.parseInt(br.readLine());

		for (long caso = 1; caso <= casos; caso++)
		{
			String[] datos = br.readLine().split(" +");
			int A = Integer.parseInt(datos[0]);
			int B = Integer.parseInt(datos[1]);
			int pairs = 0;
			TreeSet lstPairs = new TreeSet<String>();

			if (A >= 10)
			{
				for (int i = A; i <= B; i++)
				{
					String original = Integer.toString(i);
					// System.out.print(original + " : ");
					for (int j = 1; j < original.length(); j++)
					{
						String corrido = original.substring(j) + original.substring(0, j);
						int test = Integer.parseInt(corrido);
						if (test <= B && test > i)
						{
							// System.out.print(corrido + " ");
							pairs++;
							String pareja = original + "-" + corrido;
							lstPairs.add(pareja);
						}
					}
					// System.out.println("");
				}
			}

			System.out.println("Case #" + caso + ": " + lstPairs.size());
		}

		br.close();
	}
}
