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

}

package qual;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class Recycled {
	public static void main(String[] args) throws IOException {
		new Recycled().run();
	}
	class Pair {
		int a, b;
		Pair(int a, int b) {
			this.a = a;
			this.b = b;
		}
		public boolean equals(Object other) {
			Pair p = (Pair) other;
			return this.a == p.a && this.b == p.b;
		}
		public int hashCode() {
			return this.a * 2000003 + this.b;
		}
		
	}
	public HashSet<Pair> set = new HashSet<Pair>();
	
	void add(Pair p, int left, int right) {
		if (p.a < p.b && left <= p.a && p.a <= right && left <= p.b && p.b <= right) {
			set.add(p);
		}
	}
	
	int powers[] = {10, 100, 1000, 10000, 100000, 1000000, 10000000};
	
	void fill(int left, int right, int curpow) {
		for (int i = left; i <= right; i++) {
			int val = i;
			for (int p : powers) {
				if (val >= p) {
					int lp = val / p;
					int rp = val % p;
					int newval = rp * (curpow / p) + lp;
					add(new Pair(val, newval), left, right);
				}
			}
		}
	}
	
	public void run() throws IOException {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		fill(1,       9,       10);
		fill(10,      99,      100);
		fill(100,     999,     1000);
		fill(1000,    9999,    10000);
		fill(10000,   99999,   100000);
		fill(100000,  999999,  100000);
		fill(1000000, 2000000, 10000000);
		
		int tests = in.nextInt();
		for (int test = 0; test < tests; test++) {
			int a = in.nextInt(), b = in.nextInt();
			int count = 0;
			for (Pair p: set) {
				if (a <= p.a && p.a <= b && a <= p.b && p.b <= b) {
					count++;
				}
			}
			out.printf("Case #%d: %d\n", test + 1, count); 
		}
		out.close();
	}
}
