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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class RecycledPairs {
	public static void main(String []args) throws NumberFormatException, IOException{
		BufferedReader in = new BufferedReader(new FileReader("input.in"));
		String hm="", line[];
		int n =Integer.valueOf(in.readLine()), m=1, a, b, c;
		for(m=1;m<=n;m++){
			System.out.print(m+" ");
			line=in.readLine().split(" ");
			a=Integer.valueOf(line[0]); b=Integer.valueOf(line[1]);
			c=0;
			for(int i=a;i<b;i++){
				for(int j=i+1;j<=b;j++){
					//System.out.println("ANA: "+i+" "+j);
					if(recycled(String.valueOf(i),String.valueOf(j))) c++;
				}
			}
			hm+="Case #"+m+": "+c+"\n";
		}
		System.out.println();
		System.out.println(hm);
	}

	private static boolean recycled(String n, String m) {
		String aux=""; int li=0;
		int leng=n.length();
		//System.out.println("Length: "+leng);
		if(leng==1) return false;
		for(int i=leng-1;i>0;i--){
			aux=String.valueOf(n.charAt(leng-1));
			aux+=n.substring(0, leng-1);
			n=aux;
			//System.out.println(aux+" "+m);
			if(n.equals(m))
				return true;
		}
		return false;
	}
}
