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


public class Jam3 
{
	
	public static String recycled(int start, int end){
			
		int cnt = 0;
		HashSet<String> seenit = new HashSet<String>();
		for(int i=start; i <= end; i++){
			String x = ""+i;
			cnt += permutationsInRange(i, start , end, seenit);
		}
		return ""+cnt;
	}
	
	public static String rev(String in){
		//p("in: " + in);
		StringBuffer sb = new StringBuffer();
		for(int i=in.length()-1; i>=0; i--){
			sb.append(in.charAt(i));
		}
		String out = sb.toString();
		//p("o: " + out);
		return out;
	}
	
	public static String solveLine(String in){
		String[] s = in.split(" ");
		int start = Integer.parseInt(s[0]);
		int end   = Integer.parseInt(s[1]);

		//System.out.println(totals);
		
		return recycled(start, end);
	}
	
	public static void solveStrings(String[] input)
	{		
		for(int i=1; i<input.length; i++){
			String out = "Case #" + i + ": " + solveLine(input[i]);
			System.out.println(out);
		}		
	}
	
	public static int permutationsInRange(int in, int min, int max, HashSet<String> seenit)
	{		
		int count = 0;
		p("in: " + in +  " min_s " + min + " " + max);
		String in_s = ""+in;
		StringBuffer sb = new StringBuffer(in_s);
		String rev = rev(sb.toString());
		for(int i=0; i <in_s.length()-1; i++){
			char first = sb.charAt(0);
			sb.replace(0, 1, "").append(first);
			int test = Integer.parseInt(sb.toString());
			p("p: " + sb.toString());
							
			if(sb.toString().startsWith("0")){
				continue;
			}
			int low = Math.min(in, test);
			int hi = Math.max(in, test);
			if(seenit.contains(low+"_"+hi)){
				continue;
			}
			if(test==in)
				continue;
			if(test>=min && test<=max){
				p("match: " + test + " in: " + in);
				seenit.add(low + "_" + hi);				
				count++;
			}
		}
		return count;
		
	}
	
	public static String[] getLines(String fileName)
	{
		String[] lines  = null;
		try {
			FileInputStream fis = new FileInputStream(fileName);
			int nxtchar = 0;
			StringBuffer sb = new StringBuffer();
			while((nxtchar=fis.read())!=-1){
				sb.append((char)nxtchar);
			}
			lines = sb.toString().split("\r\n|\n");
		} catch (Exception e) {
			e.printStackTrace();
		}
		return lines;	
	}
	
	public static void main(String[] args) 
	{
		solveStrings(getLines(args[0]));
	}
	
	public static void p(Object a){
		//System.out.println(""+a);
	}

	public static void p2(Object a){
		System.out.println(""+a);
	}
	
}
