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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.HashSet;

public class CRecycledNumbers {
	public static HashSet<Integer> hs = new HashSet<Integer>();
	public static int m;

	public static void solve() throws NumberFormatException, IOException {
		File f = new File("E:\\downloads\\C-small-attempt0.in");
		BufferedReader reader = new BufferedReader(new FileReader(f));
		File f2 = new File("C:\\Users\\kimo\\Desktop\\out.txt");
		BufferedWriter writer = new BufferedWriter(new FileWriter(f2));
		int x = Integer.parseInt(reader.readLine());
		String st[] = null;

		for (int k = 0; k < x; k++) {
	
			st = reader.readLine().split(" ");
			int n = Integer.parseInt(st[0]);
			m = Integer.parseInt(st[1]);
			int count = 0;
			for (int i = n; i < m + 1; i++) {
				
				if (i < m) {
					count += numOfways(i + "");
				}
			}
			writer.write("Case #" + (k + 1) + ": " + count);
		writer.newLine();
		}
		writer.close();
		reader.close();
	}

//	public static boolean check(String n, String m) {
//		boolean found = false;
//		int i = 0;
//		for (; i < n.length() && !found; i++) {
//			if (n.charAt(i) == m.charAt(0)) {
//				found = true;
//			}
//		}
//
//		int j = 0;
//		i = i - 1;
//		while (j < m.length() && found) {
//
//			if (n.charAt(i) != m.charAt(j))
//				found = false;
//			j++;
//			i = (i + 1) % m.length();
//		}
//		return found;
//	}

	public static int numOfways(String n) {
		String tail = "";
		String head = "";
		String ss = "";
		int counter = 0;
hs.clear();
		for (int i = 1; i < n.length(); i++) {
			tail = n.substring(i, n.length());
			head = n.substring(0, i);
			ss = tail + head;
			
			int ssi = Integer.parseInt(ss);
			if ((ssi + "").length() == n.length()&&ssi>Integer.parseInt(n)) {
				if ( ssi <= m&&!hs.contains(ssi)) {
					hs.add(ssi);
					
					counter++;
				}
				
			}

		}
		return counter;

	}

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		solve();
		//m=500;
		//System.out.println(numOfways("301"));
	}

}
