
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.FileReader;
import java.util.StringTokenizer;


public class REcycledNumbers {
	
	public static void main(String args[]) throws Exception {
		String line = "";
		BufferedReader br =	new BufferedReader(new FileReader("/Users/ravipalacherla/Documents/workspace/CodeJam/src/input.txt"));
		int T = Integer.parseInt(br.readLine());
		int j=0;
		while((line = br.readLine()) != null) {
			StringTokenizer st = new StringTokenizer(line," ");
			String strA = st.nextToken();
			String strB = st.nextToken();
			int intA = Integer.parseInt(strA);
			int intB = Integer.parseInt(strB);
			int count = 0;
			
			int intn = intA;
			while(intn < intB) {
				String strn = Integer.toString(intn);
				for(int i = strn.length()-1; i>0;i--) {
					String	strm = strn.substring(i)+strn.substring(0,i);
					if(strm.charAt(0) == '0') continue;
					int intm = Integer.parseInt(strm);
					if( ((""+intn).length() != (""+intm).length()) || ((""+intn).length() != (""+intA).length())) continue;
					if(intn == intm) continue;
					if ( ( intA <= intn) && (intn < intm) && (intm <= intB) ) {
					//	System.out.println("intN is " + intn + " intM is "+ intm);
						count ++;
					}
				}
				intn++;
			}
			j++;
			System.out.println("Case #"+ j +": "+count);
		}
	}
}
