
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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class QRProblemC {
	public static void main(String[] args) {
		try {
			char problem = 'C';
			int attempt = 1;
			BufferedReader input = new BufferedReader(new FileReader(problem + "-small-attempt" + attempt + ".in"));
			BufferedWriter output = new BufferedWriter(new FileWriter(problem + "-small-attempt" + attempt + ".out"));
			int lines = Integer.parseInt(input.readLine());
			for (int i = 0; i < lines; i++) {
				String in = input.readLine();
				System.out.println(in);
				String out = "";
				//Code here
				String[] numbers = in.split(" ");
				int A = Integer.parseInt(numbers[0]);
				int B = Integer.parseInt(numbers[1]);
				int count = 0;
				for (int n = A; n < B; n++) {
					for (int m = n + 1; m <= B; m++) {
						String goal = Integer.toString(m);
						String start = Integer.toString(n);
						while (start.length() < goal.length()) start = "0" + start;
						for (int j = 1; j < start.length(); j++) {
							if (start.charAt(j) == goal.charAt(0)) {
								if (goal.equals(start.substring(j) + start.substring(0, j))) {
									count++;
									break;
								}
							}
						}
					}
				}
				out = Integer.toString(count);
				//End code
				out = "Case #" + (i + 1) + ": " + out.trim();
				System.out.println(out);
				output.append(out);
				if (i < lines - 1) output.append("\n");
			}
			input.close();
			output.close();
		}
		catch (Exception e) {
			System.err.println(e.getMessage());
			e.printStackTrace();
		}
	}
}
