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.awt.List;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class recycle {
	static int lower = 0;
	static int upper = 0;
	static int count = 0;
	static HashSet<String> num_list = new HashSet<String>();
	public static void PerformShift(int number) {
		int start = number;
		int numdigits = (int) Math.log10((double) number);
		int multiplier = (int) Math.pow(10.0, (double) numdigits);
		while (true) {
			//int q = number / 10;
			int r = number % 10;			
			number = number / 10;
			number = number + multiplier * r;			
					
			boolean flg = true;
			int bits = 0;			
			
			if(number != start && number >= lower && number <=upper) {
				num_list.add(number+":"+start);
				num_list.add(start+":"+number);	
			}
			
			if (number == start)
				break;
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		BufferedWriter out = new BufferedWriter(new FileWriter("output.txt"));
		int no_cases = Integer.parseInt(in.readLine());
		for (int index = 0; index < no_cases; ++index) {
			StringTokenizer limits = new StringTokenizer(in.readLine()," ");
			lower = Integer.parseInt(limits.nextToken());
			upper = Integer.parseInt(limits.nextToken());
			int start = (int) System.currentTimeMillis();
			for (int i = lower; i <= upper; ++i) {
				if(i<9)
					continue;
				PerformShift(i);
			}
			if(index==no_cases-1)
				out.write("Case #" + (index + 1) + ": " + num_list.size()/2);
			else out.write("Case #" + (index + 1) + ": " + num_list.size()/2 + "\n");
			num_list.clear();
		}
		out.close();
	}
}
