
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class RecycledNumbers {

	public static int outputLine(String inputLine){
		int count = 0;
		String[] inputArray = inputLine.split(" ");
		ArrayList line = new ArrayList(Arrays.asList(inputArray));
		int min = Integer.parseInt((String) line.get(0));
		int max = Integer.parseInt((String) line.get(1));
		
		
		for (int k = min; k <= max; k++) {
			
			for (int j = min; j <= max; j++) {
				int numbDigits = String.valueOf(min).length();
				for (int x = 0; x <numbDigits; x++) {
					if ((String.valueOf(j).substring(numbDigits - (x+1), numbDigits) + String.valueOf(j).substring(0,numbDigits - (x+1))).equals(String.valueOf(k))) {
						if (k < j) {
						count++;
						}
					}
				}
			}
		}
			
		return  count;
	}
	
	
	public static void main (String [] args) {
		ArrayList answers = new ArrayList();
		System.out.println("Insert a number.");
		int i;
		Scanner scan = new Scanner(System.in);
		i = Integer.parseInt(scan.nextLine());
		
		for (int j = 0; j< i; j++) {
			String inputLine = scan.nextLine();
			answers.add(outputLine(inputLine));
			}
		
		for (int j = 0; j < answers.size(); j++){
			System.out.println("Case #" + (j+1) + ": " + (answers.get(j)));
		}
	}		
}
