import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

/**
 * 
 */

import hack.PolynomialFactoring;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 * http://code.google.com/codejam/contest/dashboard?c=1460488#s=p2 a pair of
 * distinct positive integers (n, m) is recycled if you can obtain m by moving
 * some digits from the back of n to the front without changing their order.
 * 
 * @author y
 */
public class RotateNumbers {

	/**
	 * Given integers A and B with the same number of digits and no leading
	 * zeros, how many distinct recycled pairs (n, m) are there with A ¡Ü n < m ¡Ü
	 * B?
	 * 
	 * @param min
	 * @param max
	 */
	static int pairsRotated  (int min, int max){
		if(max<10 || max<=min){return 0;}
		int ret = 0;
		
		for(int j=min; j<max; j++){
			String s = String.valueOf(j);

			HashSet<Integer> set = new HashSet<Integer>();
			
			for(int k=1; k<s.length(); k++){//iterate each digit
				
				//rotate from bigger digit
				if(s.charAt(k)>=s.charAt(0)){ //=212-> 221. ignore repeat, count (12, 21) once
					
					String rotateString = s.substring(k) + s.substring(0, k);	
					
					int rotate = Integer.valueOf(rotateString);
					
					if((j<rotate) && (rotate <=max)){ //rotate>=min
						if(!set.contains(rotate)){
							set.add(rotate);
							ret ++; 
						}						
						//System.out.println(j + "-> " + rotate);
					}
				}
			}
		}
		
		return ret;
	}

	public static void main(String[] args) {
		
		createOutput();

		List<String[]> input = readLine();

		for (int j = 0; j < input.size(); j++) {

			String[] line = input.get(j);
			int n =  Integer.parseInt(line[0]);
			int k =  Integer.parseInt(line[1]);
			int ret = pairsRotated(n, k);

			String outputLine = "Case #" + (j+1) + ": " + ret;
			System.out.println(outputLine);
			writeOutput(outputLine);
		}	

	}
	

	public static List<String[]> readLine(){
		return readLine("input.txt");
	}
	
	public static List<String[]> readLine(String inputFile){
		List<String[]> list = new ArrayList<String[]>();
		//String lineSeparator= System.getProperty("line.separator");
		
		try {
			InputStream stream = PolynomialFactoring.class.getClassLoader().
					getResourceAsStream(inputFile);			
			BufferedReader input = new BufferedReader(new InputStreamReader(stream));//new FileReader(inputFile));
			String line = null; 

			if ((line = input.readLine()) != null) {
			}
			
			try {
				while ((line = input.readLine()) != null) {					
					//logger.info("input: " + line );
					String[] words = line.split(" ");
					
					list.add(words);
					//parse line and run code.

				}
					
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				input.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}

		return list;
	}
	

	private static final String OUTPUT_TXT = "./output.txt";

	public static void createOutput() {

		try {
			new FileWriter(OUTPUT_TXT);
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static void writeOutput(String content) {
		BufferedWriter output;
		try {
			output = new BufferedWriter(new FileWriter(OUTPUT_TXT, true));

			try {
				output.write(content + "\r\n");
			} catch (Exception e) {
				e.printStackTrace();
			} finally {
				output.close();
			}
		} catch (IOException e1) {
			e1.printStackTrace();
		}

	}

}
