
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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	
	public static int numShift(int A, int digit){

		int num = 0, div;
		num = A %10;
		div = A /10;
		for(int i=1; i < digit ; i++)
		{
			num = num*10;
		}
		num = num + div;
		return num;
	}
	

	public static int recycleCount(int A, int B)
	{
		int count = 0;
		int num = A;
		String digit = "" + A;
		do
		{
			num = numShift(num, digit.length());
			if(num > A && num <= B)
				count++;
		}while(num != A);
		
		//System.out.print("Count: " + count + "\n");
		return count;
	}
	
	public static void runCase(int A, int B, int casenum)
	{
		int count =0;
		for(int i=A; i<B; i++)
		{
			count += recycleCount(i, B);
		}
		System.out.print("Case #" + casenum + ": " + count + "\n");
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		File ffile = new File(args[0]);
		Scanner scanner;
		scanner = new Scanner(new FileReader(ffile));
		
		int N = scanner.nextInt();
		int A, B;
		for(int i =0; i<N; i++)
		{
			A = scanner.nextInt();
			B = scanner.nextInt();
			runCase(A, B, i+1);
		}
		
	}

}
