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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;


public class main {

	/**
	 * @param args
	 * @throws Exception 
	 */

	public static int[] flag;
	public static ArrayList[] array;
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		Input in = new Input("small.txt");
		
		File file = new File("out.txt");
		FileWriter filewriter = new FileWriter(file);
		BufferedWriter bw = new BufferedWriter(filewriter);
		PrintWriter pw = new PrintWriter(bw);
		
		int n = in.getInt();
		
		for(int i = 0; i < n ; i ++){
			int result = 0;
			int num = i + 1 ;
			int a = in.getInt();
			int b = in.getInt();	
			int d = Integer.toString(a).length();
			array = new ArrayList[b+1];
			for(int j = a ; j <= b; j++){
				array[j] = new ArrayList();
			}
			for(int j = a ; j <=b ; j++){
				String s = Integer.toString(j) + Integer.toString(j);
				result += solve(s,d,a,b,j);				
			}
			
			String ans = "Case #" +num +": "+result; 
			pw.println(ans);
			System.out.println(ans);
		}
		pw.close();
		bw.close();
		filewriter.close();
	}
	
	public static int solve(String s , int d,int a , int b,int j){
		int result = 0;
		int original = j;
		
		for(int i = 0 ; i < d ; i++){
			String sub = s.substring(i+1, i+1+d);
			int subint = Integer.parseInt(sub);
			
			if(subint >= a && subint <=b && subint !=original){
				if(subint<original){
					int flag = 0;
					for(int k  = 0 ; k < array[subint].size(); k++){
						if(Integer.parseInt(array[subint].get(k).toString())==original){
							flag++;
							break;
						}
					}
					if(flag ==0){
						array[subint].add(original);
						result++;
					}
				}else{
					int flag = 0;
					for(int k  = 0 ; k < array[original].size(); k++){
						if(Integer.parseInt(array[original].get(k).toString())==subint){
							flag++;
							break;
						}
					}
					if(flag ==0){
						array[original].add(subint);
						result++;
					}
				}
			}
			
		}
		return result;
	}

}
