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


public class recycle {
	static int A=1111;
	static int B=2222;
	static int counter=0;
	static int cases=0;
	public static void main(String args[]) throws NumberFormatException, IOException{
		String temp,temp1[];
		FileReader in=new FileReader(new File("in"));
		BufferedReader br=new BufferedReader(in);
		FileOutputStream out=new FileOutputStream("out"); 
		cases=Integer.parseInt(br.readLine());
		for(int k=0;k<cases;k++){
			counter=0;
			temp=br.readLine();
			temp1=temp.split(" ");
			A=Integer.parseInt(temp1[0]);
			B=Integer.parseInt(temp1[1]);
		for(int i=A;i<B;i++)
			for(int j=i+1;j<=B;j++)
			{
				if(isRecycled(i,j))
					counter++;
			}
			out.write(("Case #"+(k+1)+": "+counter+"\n").getBytes());
		}
		System.out.println("\nans"+counter);
	}
	static boolean isRecycled(int n,int m){
		String ns=new Integer(n).toString();
		String ms=new Integer(m).toString();
		String temp;
		if(ns.length()==ms.length()){
		
			for(int i=0;i<ns.length();i++){
				temp=ns.substring(i)+ns.substring(0,i);
				if(temp.equals(ms))
					return true;
			}
		}
		return false;
	}
}
