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


public class RecycledNumbers {


	private static FileReader freader;
	private static BufferedReader buffreader;
	private static FileWriter fwriter;
	private static BufferedWriter buffwriter;
	
	public static void main(String[] args) throws IOException {
		
		freader = new FileReader("C-large.in");
		buffreader = new BufferedReader(freader);
		fwriter= new FileWriter("result-large.txt");
		buffwriter = new BufferedWriter(fwriter);
		String str = null;
		int linenum = 0;
		int i=1;
		while((str=buffreader.readLine())!=null){
			if(i==1)
				linenum=Integer.parseInt(str);
			else{
				int start = Integer.parseInt(str.split(" ")[0]);
				int end = Integer.parseInt(str.split(" ")[1]);
				int num = calRecycleNum(start, end);
				String finalStr = "Case #"+Integer.toString(i-1)+": "+Integer.toString(num)+"\n";
				buffwriter.write(finalStr);
			}
			i++;
		}
		buffwriter.close();
		fwriter.close();
		buffreader.close();
		freader.close();

	}
	
	public static int calRecycleNum(int start, int end){
		int num = 0;
		for(int i=start; i<=end; i++){
			int len = Integer.toString(i).length();
			int recycleVal = i;
			HashSet<Integer> targetSet = new HashSet<Integer>();
			for(int j=1; j<len; j++){
				recycleVal = recycleOnce(recycleVal,len);
				if(recycleVal<=i)
					continue;
				else if(recycleVal<=end && recycleVal>=start){
					if(!targetSet.contains(recycleVal)){
						num++;
						//System.out.println(i+"\t"+recycleVal);
						targetSet.add(recycleVal);
					}
					/*else{
						System.out.println("Duplicate:"+recycleVal+"\t"+i);
					}*/

				}
				
			}
		}
		//System.out.println(num);
		return num;
	}
	
	public static int recycleOnce(int val, int length){
		return (int) (val%Math.pow(10, length-1)*10+val/Math.pow(10, length-1));
	}

}
