import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.File;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

public class Permutation {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("Input"));
		PrintWriter out = new PrintWriter("Output");
		ArrayList<Integer> array2 = new ArrayList<Integer>();
		String length = in.nextLine();
		int c = 0;
		while (in.hasNext()) {
			c++;
			array2.add(in.nextInt());
			array2.add(in.nextInt());
			if (c < Integer.valueOf(length) - 1)
				in.nextLine();
		}

		int count = 0;
		array2.trimToSize();
		for (int q = 0; q < array2.size(); q += 2) {
			count++;

			int dd1 = array2.get(q);
			int dd2 = array2.get(q + 1);
			int res = 0;
			for (int i = dd1; i < dd2; i++) {
				String td1 = String.valueOf(i);
				for (int j = i + 1; j <= dd2; j++) {
					String td2 = String.valueOf(j);
					ArrayList<Integer> kk = new ArrayList<Integer>();
					int k = 0;
					do {
						k = td2.indexOf(td1.charAt(0), k + 1);
						if (k >= 0)
							kk.add(k);
					} while (k >= 0);
					kk.trimToSize();
					HashSet<Integer> hs = new HashSet<Integer>();
					for (int w : kk) {
						k = w;
						if (k >= 0) {
							String rev2 = new StringBuffer(td2.substring(0, k))
									.reverse().toString();
							String rev1 = new StringBuffer(td2.substring(k))
									.reverse().toString();
							String rev = rev2 + rev1;
							String rev3 = new StringBuffer(rev).reverse()
									.toString();
							if (Integer.valueOf(rev3) == i){
								hs.add(j);
//								res++;
								//System.out.println(res + ": " + i + " | " + rev3 + " - rev: " + j);
							}
						}
					} res += hs.size();
				}
			}
			out.println("Case #" + count + ": " + res);
		}

		in.close();
		out.close();
	}

}
