
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.*;

public class RecycledNumbers {

	public static void main(String[] args) {
		
		System.out.println("Enter case input:");
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		int[][] numbers = new int[T][2];
		for (int t = 0; t < T; t++) {
			numbers[t][0] = sc.nextInt();
			numbers[t][1] = sc.nextInt();
			sc.nextLine();
		}
		
		for (int t = 1; t <= T; t++) {
			int a = numbers[t - 1][0];
			int b = numbers[t - 1][1];
			int numRecycledPairs = 0;
			
			for (int n = a; n < b; n++) {
				String N = n + "";
				int[] matches = new int[N.length()];
				boolean duplicate = false;
				
				for (int digitFromBack = 1; digitFromBack <= N.length() - 1; digitFromBack++) {
					int newInt = Integer.parseInt(N.substring(N.length() - digitFromBack) + N.substring(0, N.length() - digitFromBack));
					if (newInt > n && newInt <= b) {
						for (int match : matches) {
							if (newInt == match)
								duplicate = true;
						}
						//System.out.print(n + ":" + newInt + " ");
						if (!duplicate) {
							matches[digitFromBack] = newInt;
							numRecycledPairs++;
						}
					}
				}
			}
			
			System.out.println("Case #" + t + ": " + numRecycledPairs);
		}
		
		

	}

}
