
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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub

		int numCase = 0;
		BufferedReader br = null;
		PrintWriter pr = null;

		try {

			br = new BufferedReader(new FileReader(args[0]));
			pr = new PrintWriter(new FileWriter("a.out"));

			numCase = Integer.parseInt(br.readLine());

			String line;
			String[] arr;

			for (int i = 0 ; i < numCase ; i++){

				line = br.readLine();
				arr = line.split(" ");
				String A = arr[0];
				String B = arr[1];
				long Along = Long.parseLong(A);
				long Blong = Long.parseLong(B);

				long count = 0;

				if (A.length() == 1)
					count = 0;
				else {
					for (long Nlong = Along; Nlong < Blong ; Nlong++){
						
						String N = "" + Nlong;
						
						long LastM = -1;
						
						for (int j = 1 ; j < N.length(); j++){
							String M = N.substring(j, N.length())+N.substring(0, j);
							
							long Mlong = Integer.parseInt(M);
							
							if (Mlong > Nlong && Mlong <= Blong && LastM != Mlong){
								count++;
								LastM = Mlong;
							}
						}

					}
				}
				
				pr.println("Case #" + (i+1) + ": " + count);
			}
			pr.flush();

		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		finally {
			if (pr != null)
				pr.close();
			if (br != null)
				br.close();
		}

	}

}