
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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;


public class Recycle {

	
	public Recycle() {
		
		String line;
		Integer maxInputs,output;
		Integer a, b;
		try {
			BufferedReader read = new BufferedReader(new InputStreamReader(getClass().getResourceAsStream("input")));
			BufferedWriter write = new BufferedWriter(new FileWriter("output"));
			maxInputs = new Integer(read.readLine());
			for(int i = 1 ; i <= maxInputs ; i++)
			{
				int success = 0;
				line = read.readLine();
				String[] numbers = line.split(" ");
				a = new Integer(numbers[0]);
				b = new Integer(numbers[1]);
				
				success = getCount(a,b);
				
				output = new Integer(success);
				write.write("Case #"+i+": ");
				write.write(output.toString());
				write.write("\n");
			}
			write.close();
		
		
		}catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		long startTime = System.nanoTime();
		new Recycle();
		long endTime = System.nanoTime();;
		System.out.println("Took "+(endTime - startTime) + " ns");
	}

	int getCount(int start, int end)
	{
		int count = 0 ;
		
		String numStart = new Integer(start).toString();
		int digits = numStart.length();
		String num ;
		char[] perm = new char[digits];
		
		
		
		
		if(digits == 1)
			return 0;
		
		for( Integer i = start; i <= end; i++)
		{
			num = i.toString();
			for( int j = 1; j < digits; j++)
			{
				for(int k = 0 ; k < digits; k++)
				{
					perm[k] = num.charAt((j+k)%digits); 
				}
				Integer permNum = Integer.parseInt(new String(perm));
				
				if(i < permNum && permNum >= start && permNum <= end)
					{
					count++;
					System.out.println(i+" "+permNum);
					}
			}
			
			
			
			
		}
		
		return count;
	}
}
/*
 * 
			if(digits == 2)
			{	
				perm[0] = num.charAt(1);
				perm[1] = num.charAt(0);
				Integer j = Integer.parseInt(new String(perm));
				
				
				if( j == i )
					continue;
				if(j >= start && j <= end)
				{
					if( i < j )
					count++;
				}
			}
			if(digits == 3)
			{
				perm[0] = num.charAt(2);
				perm[1] = num.charAt(0);
				perm[2] = num.charAt(1);
				Integer j = Integer.parseInt(new String(perm));
				if( j == i )
					continue;
				if(j >= start && j <= end)
				{
					if( i < j )
					count++;
				}
				perm[0] = num.charAt(1);
				perm[1] = num.charAt(2);
				perm[2] = num.charAt(0);
				j = Integer.parseInt(new String(perm));
				if( j == i )
					continue;
				if(j >= start && j <= end)
				{
					if( i < j )
					count++;
				}
			}
*/
