
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.*;
class yo
{
public static void main(String args[])
throws IOException
{
try
{
FileWriter fs=new FileWriter("o1.out");
FileInputStream f1=new FileInputStream("C-small-attempt3 (1).in");
DataInputStream d=new DataInputStream(f1);
BufferedReader br=new BufferedReader(new InputStreamReader(d));
BufferedWriter out=new BufferedWriter(fs);
String s,s1;
s=br.readLine();
int T=Integer.parseInt(s);
int cnt=0,nn,f,ll,ul,p;
String w1;
char temp;
for(int i=0;i<T;i++)
{
out.write("Case #"+(i+1)+": ");
s1=br.readLine();
String[] n=s1.split(" ");
ll=Integer.parseInt(n[0]);
ul=Integer.parseInt(n[1]);
p=ul-ll+1;
f=ll;
for(int j=0;j<p;j++)
{
s1=Integer.toString(f);
char c[]=new char[s1.length()];
c=s1.toCharArray();
for(int k=0;k<s1.length()-1;k++)
{
temp=c[s1.length()-1];
for(int l=(s1.length()-1);l>0;l--)
{
c[l]=c[l-1];
}
c[0]=temp;
w1="";
for(int m=0;m<s1.length();m++)
{
w1=w1+c[m];
}
nn=Integer.parseInt(w1);
if(nn>ll)
if(nn>f)
if(nn<=ul)
cnt=cnt+1;
}
f=f+1;
}
String h=Integer.toString(cnt);
out.write(h);
out.write("\r\n");
cnt=0;
}
out.close();
br.close();
}
catch(Exception e){
System.out.println("Error :"+e);
}
}
}