
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.FileOutputStream;
import java.io.IOException;
import java.util.Scanner;

public class Recycle {
	public static void main(String[] args) throws IOException {
		Recycle r = new Recycle();
		// System.out.println(r.isRecycled(12345, 34512));

		String fileInput = "in.txt";

		Scanner s = new Scanner(new File(fileInput));

		int T = 0;

		T = Integer.parseInt(s.nextLine());
		FileOutputStream fos = new FileOutputStream(new File("out.txt"));

		for (int i = 1; i <= T; i++) {
			// System.out.println("Case #" + i + ": "
			// + r.recycle(s.nextInt(), s.nextInt()));
			fos.write(String.format("Case #%d: %d" + (i < T ? "\n" : ""), i,
					r.recycle(s.nextInt(), s.nextInt())).getBytes());
		}

	}

	private int recycle(int a, int b) {

		int count = 0;
		for (int n = a; n < b; n++) {
			for (int m = n + 1; m <= b; m++) {
				if (isRecycled(n, m)) {
					// System.out.println("n=" + n + " m=" + m);
					count++;
				}
			}
		}
		return count;
	}

	private boolean isRecycled(int n, int m) {
		String nm = "" + n + n;
		if (!nm.contains("" + m))
			return false;
		nm = nm.replace("" + m, "");
		nm = nm.replace("" + n, "");
		return nm.isEmpty();
	}
}
