
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.util.Scanner;

public class C {
	public static void main (String[] args)
	{
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int a, b;
		int[] list;
		for (int i = 1; i <= n; i++)
		{
			a = scan.nextInt();
			if (a < 10)
				a = 10;
			b = scan.nextInt();
			int count = 0;
			for (int j = a; j < b; j++)
			{
				String str = "" + j;
				int len = str.length();
				list = new int[len];
				int lp = 0;
				for (int k = 1; k < len; k++)
				{
					String str2 = str.substring(len-k) + str.substring(0, len-k);
					int res = Integer.valueOf(str2);
					if (str2.charAt(0) != '0' && res > j && res <= b)
					{
						if (!contains(list, lp, res))
						{
							list[lp] = res;
							lp++;
							//System.out.println(j + " " + res);
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
		}
	}
	private static boolean contains(int[] list, int lp, int res)
	{
		for (int i = 0; i < lp; i++)
			if (list[i] == res)
				return true;
		return false;
	}
}
