
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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class ProblemC {

	public static void main(String[] args) throws FileNotFoundException {

		String test = "4\n" + "1 9\n" + "10 40\n" + "100 500\n" + "1111 2222\n";

		Scanner sc = new Scanner(new File("C-small-attempt0.in"));
		int teller = 0;
		int numLines = 0;
		String finalOut = "";
		boolean print = false;

		int n = 0;// smal number
		int m = 0;// big number
		int A = 0; // min number
		int B = 0; // max number

		int S = 0; // answare
		String[] split;

		while (true) {
			String line = sc.nextLine();
			if (teller == 0) {
				numLines = Integer.valueOf(line);
			} else {
				print = true;
				split = line.split(" ");
				A = Integer.valueOf(split[0]);
				B = Integer.valueOf(split[1]);

				for (n = A; n < B; n++) {
					for (m = n + 1; m <= B; m++) {
						S += check(n, m);
					}
				}

			}

			if (print) {

				if (teller == numLines) {
					System.out.println("Case #" + teller + ": " + S);
					finalOut += "Case #" + teller + ": " + S;
					break;
				} else {
					System.out.println("Case #" + teller + ": " + S);
					finalOut += "Case #" + teller + ": " + S + "\n";
				}
				S = 0;

			}
			teller++;
		}

		PrintWriter writer = new PrintWriter(new File("out.txt"));

		writer.print(finalOut);
		writer.close();

	}

	private static int check(int n, int m) {

		String N = "" + n;
		String M = "" + m;
		if (M.length() == 1) {
			return 0;
		}

		for (int i = 1; i < N.length(); i++) {

			String temp = N.substring(N.length() - (i), N.length());
			temp += N.substring(0, N.length() - (i));


			if (temp.equals(M)) {
				return 1;
			}
		}
		return 0;
	}

}
