
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.IOException;
import java.io.PrintWriter;
import java.io.RandomAccessFile;
import java.util.Hashtable;

public class codejamb {

	/**
	 * @param args
	 * @throws IOException
	 * @throws NumberFormatException
	 */
	public static void main(String[] args) throws Exception {
		RandomAccessFile r = new RandomAccessFile("testcase.txt", "r");
		PrintWriter p = new PrintWriter("out.txt");
		int t = Integer.parseInt(r.readLine());
		for (int i = 1; i <= t; i++) {
			String[] line = (r.readLine()).split(" ");
			int a = Integer.parseInt(line[0]);
			int b = Integer.parseInt(line[1]);
			int count = countIt(a, b);
			p.println("Case #" + i + ": " + count);
		}
		p.close();

	}

	static int countIt(int a, int b) {
		int count = 0;
		for (int i = a; i <= b; i++) {
			for (int j = i + 1; j <= b; j++) {
				if (checkPair(i + "", j + "")) {
					count++;
				}
			}
		}
		return count;
	}

	static boolean checkPair(String x, String y) {
		if (x.length() == y.length() && isTheSame(x, y)) {
			for (int i = x.length() - 1; i >= 0; i--) {
				String sub = x.substring(i);
				// String sub2 = y.substring(0, sub.length());
				String newStr = sub + x.substring(0, i);
				if (newStr.equalsIgnoreCase(y))
					return true;
			}
			return false;
		} else {
			return false;
		}
	}

	static boolean isTheSame(String x, String y) {
		char[] xArr = x.toCharArray();
		char[] yArr = y.toCharArray();
		for (int i = 0; i < xArr.length; i++) {
			for (int j = 0; j < yArr.length; j++) {
				if (xArr[i] == yArr[j]) {
					xArr[i] = 0;
					yArr[j] = 0;
					break;
				}
			}
		}
		for (int i = 0; i < yArr.length; i++) {
			if (yArr[i] != 0 || xArr[i] != 0)
				return false;
		}
		return true;
	}

}
