package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.*;
import java.io.*;


public class C {
	public static final String INPUT_FILE = "C-large.in";
	public static final String OUTPUT_FILE = "cLarge.out";

	public static void main(String[] args) throws FileNotFoundException {
		
		Scanner input = new Scanner(new File(INPUT_FILE));
		PrintStream output = new PrintStream(new File(OUTPUT_FILE));
		
		Map<Integer, Integer> answerKey = new HashMap<Integer, Integer>();
		answerKey.put(1,0);
		answerKey.put(2,1);
		answerKey.put(3,3);
		answerKey.put(4,6);
		answerKey.put(5,10);
		answerKey.put(6,15);
		answerKey.put(7,21);
		
		
		int trials = Integer.parseInt(input.nextLine());


		// START
		for(int i = 1; i <= trials; i++) {
			String[] line = input.nextLine().split(" ");
			int A = Integer.parseInt(line[0]); 
			int B = Integer.parseInt(line[1]);
			
			Set<Integer> seen = new HashSet<Integer>();
			List<Integer> answer = new ArrayList<Integer>();
			
			int length = getLength(A);
			
			if(length > 1) {
				for(int j = A; j <= B; j++) {
					
					if(!seen.contains(j)) {
					
						answer.add(numberOfPerms(A, B, j, length, seen));
					
					} // It is seen, so don't do anything
				}			
			} else { // length = 1			
			}			
			
			int answerCount = 0;
			for(int k = 0; k < answer.size(); k++) {
				answerCount += answerKey.get(answer.get(k));
			}
			
			output.print("Case #" + i + ": " + answerCount);
			if(i != trials) {
				output.println();
			}
	
		}
		
	}
	
	public static int numberOfPerms(int A, int B, int num, int length, Set<Integer> s) {
		int original = num;
		int count = 1;
		int permute = permute(num, length);
		s.add(original);
		while(original != permute) {
	
			if(permute >= A && permute <= B && !s.contains(permute)) {
				s.add(permute); // add bc we've now seen it
				count++;        // we have a good permute
			}
			
			permute = permute(permute, length);	
		}
		return count;
	}


	public static int getLength(int num) {
		return (num + "").length();

	}

	public static int permute(int num, int length) {
		int a = num % 10;
		int b = num / 10;
		return a * (int) Math.pow(10, length-1) + b;		
	}
	
}