
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 CC {

	
	public static void main(String[] argv){
		Scanner in = new Scanner ( System.in );
		int T=in.nextInt();
		
		for(int i=0; i<T; i++){
			
			int A=in.nextInt(); int B=in.nextInt();
			//boolean[] have=new boolean[B+1];  
			int Rep=0;
			
			for(int x=A; x<B; x++){
				for(int y=x+1; y<=B; y++){
					if((""+x).length()==1 ||(""+y).length()==1 || (""+y).length()!=(""+x).length()) continue;
					
					if(areCycl(x,y))
						Rep++;
				}
			}
			System.out.println("Case #"+(i+1)+": "+Rep);
		}
	}

	private static boolean areCycl(int x, int y) {
		String s=""+x;
		for(int p=1; p<=s.length(); p++){
			String s1=s.substring(0,p);
			String s2=s.substring(p);
			String ss=s2+s1;
			int xx=Integer.parseInt(ss);
			if(xx==y)
				return true;
		}
		return false;
	}
}