
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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;

public class RecycledNumbers {

	public RecycledNumbers() {
		solve();
	}

	/**
	 * Solves Problem A. Speaking in Tongues
	 */
	private void solve() {
		try {
			File f = new File("./C-small-attempt0.in.txt");
			File output = new File("./output2.out");

			if (output.exists())
				output.delete();

			output.createNewFile();

			PrintWriter pw = new PrintWriter(output);
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);

			String linea = br.readLine();
			linea = br.readLine();

			int i = 1;
			while (linea != null) {
				int a = Integer.parseInt(linea.split(" ")[0]);
				int b = Integer.parseInt(linea.split(" ")[1]);

				pw.println("Case #" + i + ": " + getRecycledAmmount(a, b));
				linea = br.readLine();
				i++;
			}

			pw.close();
			br.close();
			fr.close();

		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	private int getRecycledAmmount(int start, int end) {
		int ammount = 0;

		for (int n = start; n <= end; n++) {
			for (int m = start; m <= end; m++) {
				if (n < m && isRecycled("" + n, "" + m))
					ammount++;
			}
		}

		return ammount;
	}

	private boolean isRecycled(String n, String m) {

		for (int i = m.length()-1; i > 0; i--) {
			
			String prefix = m.substring(0, i);			
			String suffix = m.substring(i);
			
			String recycled = suffix + prefix;
			if(recycled.equals(n))
				return true;

		}

		return false;

	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new RecycledNumbers();
	}

}
