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 c;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		sc.nextLine();
		
		int nbr = 1;
		while (t-- > 0) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int score = 0;
			
			Set<Integer> set = new HashSet<Integer>();
			
			while (a < b) {
				if (!set.contains(a)){
					String s = a+"";
					Set<Integer> temp = new HashSet<Integer>();
					for (int i = 0; i < s.length(); i++) {
						if (s.charAt(0) != '0'){
							int asdf = Integer.parseInt(s);
							if (a <= asdf && asdf <= b){
								temp.add(asdf);
							}
						}
						s = s.substring(1, s.length()) + s.charAt(0);
					}
					set.addAll(temp);
					int n = temp.size();
					while (n > 1){
						score += --n;
					}
				}
				a++;
			}

			System.out.printf("Case #%d: %d\n", nbr++, score);
		}
	}
}
