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.*;
import java.util.*;

public class RecycledNumbers
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader in = new BufferedReader(new FileReader("RecycledNumbers-small-attempt0.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("RecycledNumbers-small-attempt0.out", false));

		String line = in.readLine();
		int cases = Integer.parseInt(line); // # of test cases

		for (int i = 1; i <= cases; i++)
		{
			line = in.readLine();
			String[] parts = line.split(" ");
			int a = Integer.parseInt(parts[0]);
			int b = Integer.parseInt(parts[1]);

			out.write("Case #" + i + ": " + solve(a,b));
			out.newLine();
		}

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

	}

	private static int solve(int a, int b)
	{
		Set<Pair> set = new HashSet<Pair>();
		for (int i = a; i <= b; i++)
		{
			String s = Integer.toString(i);
			char f = s.charAt(0);
			for (int j = 1, len = s.length(); j < len; j++)
			{
				if (s.charAt(j) < f) continue;
				String t = s.substring(j) + s.substring(0, j);
				int k = Integer.parseInt(t);
				if (k > i && k <= b) set.add(new Pair(i, k));
			}
		}
		return set.size();
	}

	private static class Pair
	{
		private int a;
		private int b;

		public Pair(int a, int b)
		{
			this.a = a;
			this.b = b;
		}

		public int hashCode()
		{
			return (a ^ b);
		}

		public boolean equals(Object obj)
		{
			Pair that = (Pair) obj;
			return (this.a == that.a && this.b == that.b);
		}
	}
}

