
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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;

public class RecycledPair {
	public static void main(String[] args) {

		try {

			BufferedReader br = new BufferedReader(new FileReader("input.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));
			int N;
			N = Integer.parseInt(br.readLine());
			int k,i,j;
			HashSet<Integer> set;
			for (k = 0; k < N; k++) {
				
				String[] line = br.readLine().split(" ");
				int A = Integer.parseInt(line[0]);
				int B = Integer.parseInt(line[1]);
				
				
				int counter = 0;
				

				for (i = A; i < B; i++) {
					set = new HashSet<Integer>();
					updateSet(set, i);
					for (j = i + 1; j <= B; j++) {
						if (set.contains(j)) {
							counter++;
						}
					}
				}
				bw.write("Case #" + (k+1) + ": " + counter);
				bw.newLine();
				// showSet(set);
			}

			br.close();
			bw.close();

		} catch (IOException io) {
		}

	}

	private static void updateSet(HashSet<Integer> set, int num) {

		String numStr = num + "";
		char[] numChar = numStr.toCharArray();

		int i, j;

		for (i = numChar.length - 1; i >= 1; i--) {

			if (numChar[i] != '0') {

				char[] newNum = new char[numChar.length];
				j = i;
				int counter = 0;
				newNum[counter] = numChar[j];
				counter++;
				while (counter < numChar.length) {
					if (j < numChar.length - 1) {
						j++;
					} else {
						j = 0;
					}
					newNum[counter] = numChar[j];
					counter++;
				}
				set.add(Integer.parseInt(new String(newNum)));
			}
			//set.add(num);
		}
		set.add(num);
	}
/*
	private static void showSet(HashSet<Integer> set) {

		for (Integer s : set) {
			System.out.println(s);
		}
	}
*/
}
