
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.*;
import java.util.Scanner;
public class tknowjam3 {
	
	public static void main(String args[]) throws java.lang.Exception
	{
		
		int a,b,n,m, cnt=0,len=0;
		
		int t,cas=1;
		Scanner scan=new Scanner(new FileReader("tknowjam3in" + ".in"));
		PrintWriter out=new PrintWriter("tknowjam3out" + ".out");
		t=scan.nextInt();
		while(t!=0)
		{
		t--;
		cnt=0;
		a=scan.nextInt();
		b=scan.nextInt();
		String str1,tstr1;
		
		for(int i=a;i<=b;i++)
		{
			str1=Integer.toString(i);
			for(int j=a;j<=b;j++)
			{
				if(i!=j && i<j)
				{
					len=str1.length();
					for(int k=1;k<len;k++)
					{
						tstr1=str1.substring(0,len-k);
						tstr1=str1.substring(len-k)+tstr1 ;
						
						if(tstr1.equals(Integer.toString(j)))
						{
							k=len;
							
							cnt++;
						}
						
						
						
					}
					
					
				}
				
				
			}
		}
		
	
		System.out.println("Case #"+cas+": "+cnt);
		out.println("Case #"+cas+": "+cnt);
		cas++;
		
		
		}
	
	
	out.close();
	}

}
