
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;
	}
	

}
/**
 * @(#)C.java
 *
 *
 * @author
 * @version 1.00 2012/4/14
 */
import java.util.*;
import java.io.*;

public class C {
	public static int recycle(int a, int b) {
		int count = 0;
		ArrayList<String> pair = new ArrayList<String>();
		for(int i = a; i <= b; i++) {
			for(int j = i+1; j <= b; j++) {
				String n1 = "" + i;
				String n2 = "" + j;
				for(int k = 1; k <= n1.length(); k++) {
					if((n2.substring(k) + n2.substring(0, k)).equals(n1) && !pair.contains(n1+n2)) {
						//System.out.println(n1 + " equals " + n2);
						count++;
						pair.add(n1+n2);
					}
				}
			}
		}

		return count;
	}

	public static void main(String [] argz) throws IOException {
		Scanner reader = new Scanner(new File("C-small-attempt0.in"));
		int numCases = reader.nextInt();
		reader.nextLine();

		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);

    	for(int i = 0; i < numCases; i++) {
    		Scanner lineReader = new Scanner(reader.nextLine());
    		int a = lineReader.nextInt();
    		int b = lineReader.nextInt();
    		out.write("Case #" + (i+1) + ": " + recycle(a, b) + "\n");
    	}

		out.close();

	}
}