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();
	}
}

package codejam20120413;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

public class C {
	int digits(int in) {
		int count=0;
		for (;(in=in/10)>0; count++);
		return count;
	}
	int shift(int in, int mag) {	
		return  mag*(in%10) + in/10;
	}
	void run()throws IOException{
		BufferedReader bf = new BufferedReader(new FileReader("C.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C.out"));
		
		int cases = Integer.parseInt(bf.readLine());
		for (int i=0; i<cases; i++) {
			String[] s = bf.readLine().split(" ");
			int from = Integer.parseInt(s[0]);
			int to = Integer.parseInt(s[1]);
			int count=0;
			for (int j=from; j<to; j++) {
				int in = j;
				int digits = digits(in);
				int mag = 1;
				for (int k = 0; k < digits; k++) {
					mag = mag*10;
				}
				HashSet<Integer> set = new HashSet<Integer>();
				for (int k = 0; k < digits; k++) {
					int shift = shift(in, mag);
					if (shift>j && shift <= to) {
						if (!set.contains(shift)) {
							set.add(shift);
							count++;
						}
					}
					in=shift;
				}
			}
			pw.write("Case #"+ (i+1) + ": "+ count + "\n");
		}
		pw.close();
	}
		
	public static void main(String[] args)throws IOException {
		new C().run();
	}
	
	
}
