
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.IOException;
import java.util.Scanner;


public class Recycle {

	
	public static void main (String[] args) {
		int s, t;
		Scanner scanner;
		
		try {
			scanner = new Scanner(new File("C:\\a.in"));
			if(scanner.hasNextLine()) {
				scanner.nextLine();
			}
			int testCase = 1;
			while(scanner.hasNextLine()) {
				String line = scanner.nextLine();
				Scanner iscn = new Scanner(line);
				s = iscn.nextInt();
				t = iscn.nextInt();
				iscn.close();
				
				int counter = 0;
				for(int i=s; i<=t; i++) {
					for(int j=s; j<i; j++) {
						if(isRecycled(i+"", j+"")) {
							counter++;
						}
					}
				}
				
				System.out.println("Case #"+testCase+": " +counter);
				testCase++;
			}
		} catch (IOException e) {
			System.err.println("could not open file");
		}
		
		
	}


	private static boolean isRecycled(String a, String b) {
		for(int i=1; i<a.length(); i++) {
			if(cycleBy(a, i).equals(b)) {
				return true;
			}
		}
		return false;
	}
	
	public static String cycleBy(String str, int places) {
		return str.substring(places) + str.substring(0, places);
	}
	
}
