
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.*;

public class Main {
	public static void main(String[] args) {
		Main m = new Main();
		try {
			FileInputStream fstream = new FileInputStream("C-small-attempt2.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = br.readLine();
			int x = Integer.parseInt(strLine);
			int result;
			String[] a;
			for (int j = 0; j < x; j++) {
				System.out.print("Case #" + (j + 1) + ": ");
				strLine = br.readLine();
				a = strLine.split(" ");
				result = 0;
					int first = Integer.parseInt(a[0]);
					int second = Integer.parseInt(a[1]);
					
					for (int i = first; i < second; i++) {
						for (int k = i + 1; k <= second; k++) {

							boolean b = m.check(i + "", k + "");
							if (b)
								result++;
						}
					}
				System.out.println(result);
			}
			in.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("error");
		}
	}

	private boolean check(String i, String k) {
		boolean b = false;

		for (int j = k.length() - 1; j >= 0; j--) {

			k = k.charAt(k.length() - 1) + "" + k.substring(0, k.length() - 1);

			if (k.equalsIgnoreCase(i)) {
				b = true;
				break;
			}
			if (b) break;
		}

		return b;
	}
}