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 java.io.*;
import java.util.ArrayList;

public class RecycledNumbers {

	static int caseNumber;
	static int totalCases;

	public static void main(String[] args) throws Exception {

		caseNumber = 1;

		File fileIn = new File("C:\\GCJ\\RecycledNumbers\\C-large.in");
		FileInputStream fileInputStream = null;
		BufferedInputStream inputStream = null;
		BufferedReader reader = null;
		Writer out;

		String newLine = System.getProperty("line.separator");

		String fileOutPath = "C:\\GCJ\\RecycledNumbers\\largeOutput.txt";
		File fileOut = new File(fileOutPath);
		if (!fileOut.createNewFile()) {
			fileOut.delete();
			fileOut.createNewFile();
		}

		out = new OutputStreamWriter(new FileOutputStream(fileOutPath), "US-ASCII");

		StringBuilder builder = new StringBuilder();

		try {
			fileInputStream = new FileInputStream(fileIn);

			// Here BufferedInputStream is added for fast reading.
			inputStream = new BufferedInputStream(fileInputStream);
			reader = new BufferedReader(new InputStreamReader(inputStream));

			totalCases = Integer.parseInt(reader.readLine());
			while (caseNumber <= totalCases) {
				builder.append(handleTestCase(reader));
				builder.append(newLine);
				caseNumber++;
			}

			// dispose all the resources after using them.
			fileInputStream.close();
			inputStream.close();
			reader.close();

		} catch (Exception e) {
			e.printStackTrace();
		}
		System.out.print(builder.toString());
		out.write(builder.toString());
		out.close();
	}

	public static String handleTestCase(BufferedReader reader) throws Exception {
		String[] numsAsStrings = reader.readLine().split(" ");
		int start = Integer.parseInt(numsAsStrings[0]);
		int end = Integer.parseInt(numsAsStrings[1]);
		int pairs = 0;
		int current = start;
		while (current <= end){
			pairs += getNumRecycledPairsInRange(current, start, end);
			current++;
		}
		return "Case #"+caseNumber+": "+pairs;
	}
	
	public static int getNumRecycledPairsInRange(int orig, int start, int end){
		int pairs = 0;
		ArrayList<Integer> options = getAllRotationsInRange(orig, start, end);
		for(int i = 0; i < options.size(); i++){
			if (orig < options.get(i)){
				pairs++;
			}
		}
		return pairs;
	}
	
	public static ArrayList<Integer> getAllRotationsInRange(int orig, int start, int end){
		if(orig < 10)
			return new ArrayList<Integer>(0);
		char[] origAsChars = String.valueOf(orig).toCharArray();
		ArrayList<Integer> allRotations = new ArrayList<Integer>(origAsChars.length-1);
		char[] curRotation = origAsChars;
		
		// i < length - 1 because I don't want to repeat the original by doing it the full time
		for(int i = 0; i < origAsChars.length - 1; i++){ 
			char temp = curRotation[0];
			for(int j = 1; j < origAsChars.length; j++){
				curRotation[j-1] = curRotation[j];
			}
			curRotation[curRotation.length-1] = temp;
			allRotations.add(new Integer(String.valueOf(curRotation)));
		}
		
		for(int i = 0; i < allRotations.size(); i++){
			if (allRotations.get(i) < start || allRotations.get(i) > end || allRotations.get(i) == orig){
				allRotations.remove(i);
				i--; //Because ArrayList shifts everything down an index
			}	
		}
		makeListUnique(allRotations);
		return allRotations;
	}
	public static void makeListUnique(ArrayList<Integer> list){
		for(int i = 0; i < list.size(); i++){
			for(int j = i+1; j < list.size(); j++){
				if(list.get(i).equals(list.get(j))){
					list.remove(j);
				}
			}
		}
	}
}
