
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;
class RecycledNumbers
{
	public static void main(String Args[]) throws Exception
	{
		Scanner s=new Scanner(new FileReader("inputCs.in"));
		BufferedWriter br=new BufferedWriter(new FileWriter("outputCs.txt"));
		int T, a, b,total=0;
		T=s.nextInt();
		String x,y;
		for(int I=0;I<T;I++)
		{
			total=0;
			a=s.nextInt();
			b=s.nextInt();
			for(int i=a;i<=b;i++)
			{
				for(int j=i+1;j<=b;j++)
				{
					x=new String(""+i);
					y=new String(""+j);
					if(recycled(x,y))
					{
						total++;
					}
				}
			}
			br.write("Case #"+(I+1)+": "+total);
			if(I!=T-1)
			br.write("\n");
		}
		s.close();
		br.close();
	}
	
	public static boolean recycled(String a,String b)
	{
		String d;
		char c[]=new char[a.length()];
		for(int i=0;i<a.length();i++)
		{
			c[0]=b.charAt(b.length()-1);
			b.getChars(0,b.length()-1,c,1);
			d=new String(c);
			if(d.contentEquals(a))
			return true;
			else 
			b=d;
		}
		return false;
	}
}