
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.*;
import java.io.*;

public class recycled
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader baca= new BufferedReader(new InputStreamReader(System.in));
		int T= Integer.parseInt(baca.readLine());
		for(int i=1; i<=T; i++)
		{
			StringTokenizer token= new StringTokenizer(baca.readLine());
			int A= Integer.parseInt(token.nextToken());
			int B= Integer.parseInt(token.nextToken());
			int count=0;
			
			for(int n=A; n<B; n++)
			{
				for(int m=n+1; m<=B; m++)
				{
					count=count+hitung(n,m);
				}
			}
			System.out.println("Case #"+i+": "+count);
		}
	}
	
	public static int hitung(int n, int m)
	{
		String angka= Integer.toString(n);
		String tanda= Integer.toString(m);
		char[] sesuatu=angka.toCharArray();
		char[] acuan=tanda.toCharArray();
		for(int i=0; i<angka.length(); i++)
		{
			char temp=sesuatu[0];
			for(int j=0; j< angka.length()-1; j++)
			{
				sesuatu[j]=sesuatu[j+1];
			}
			sesuatu[angka.length()-1]=temp;
			boolean b=true;
			
			for(int z=0; z<angka.length();z++)
			{
				if(sesuatu[z]!=acuan[z])
				{
					b=false;
					break;
				}
			}
			if(b==true)
			{
				return 1;
			}
		}
		return 0;
	}	
}