
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.*;
import java.io.*;
import java.lang.Number;

public class number {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner fileReader = new Scanner(new File("C-small-attempt0.in"));
		PrintStream output = new PrintStream(new File("outputAwesome2.txt"));
		

		// Process file
		int repetitions = fileReader.nextInt();
		for(int i = 1; i <= repetitions; i++) {
			output.print("Case #" + i + ": ");
			int start = fileReader.nextInt();
			int stop = fileReader.nextInt();
			
			if (start < 10 || stop < 10) {
				output.println("0");
			} else {
				int digits = 0;
				int foo = start;
				while (foo != 0) {
					foo = foo / 10;
					digits++;
				}
				
				int count = 0;

				for(int j = start; j <= stop; j++) {
					String number = j + "";
					for(int k = 1; k < digits; k++) {
						// number = 10, k = 2
						String stuff = number.substring(1) + number.charAt(0);
						if(!stuff.equals(number)) {
							number = stuff;
							//System.out.println(number);
							if(Integer.parseInt(number) <= stop && Integer.parseInt(number) >= start){
								//System.out.println("yes");
								count++;
							}
						}
					}
				}
				output.println(count / 2);
			}
		}
	}
}