
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 javax.swing.*;
import java.util.Scanner;
import java.io.*;

class ProblemC
{
	public static void main (String []sdvv) throws IOException
	{
		int cases=0, A=0, B=0, total;
		String num;
		Scanner sc;
		PrintWriter es;
		try
		{
			sc = new Scanner(new File("Csmall.IN"));
			es = new PrintWriter(new BufferedWriter(new FileWriter("solutionC.txt")));
			cases=Integer.parseInt(sc.nextLine());
			for(int j=1;j<=cases;j++)
			{
				total=0;
				es.print("Case #"+j+": ");
				A=sc.nextInt();
				B=sc.nextInt();

				for(int n=A;n<B;n++)
				{
					for(int m=n+1;m<=B;m++)
					{
						if(checkRotation(n,m))
						{
							total++;
						}
					}
				}

				es.println(total);
			}
			es.close();
		}
		catch(FileNotFoundException error)
		{
			System.out.println("no se encuentra el archivo");
		}
		catch (EOFException e)
		{
		    System.out.println("Final de Stream");
		}

	}
	public static boolean checkRotation(int n, int m)
	{
		String num=Integer.toString(n);
		String ref=Integer.toString(m);
		if(num.length()==ref.length())
		{
			int l=num.length();
			String temp=num;
			for(int z=1;z<l;z++)
			{
				temp=temp.substring(1,l);
				temp+=num.charAt(z-1);
				if(temp.equals(ref))
					return true;
			}
		}
		return false;
	}
}