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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;


public class Recycled_numbers {

	 public static boolean isSubString(String text1, String text2) {
	        return isSubString(text1, text2, false);
	    }

	    private static boolean isSubString(String text1, String text2, boolean afterMatch) {
	        if (text1.length()==0) {
	            return true;
	        }
	        if (text2.length()==0) {
	            return false;
	        }
	        return (text1.charAt(0)==text2.charAt(0) && isSubString(text1.substring(1), text2.substring(1), true)) ||
	               (!afterMatch && isSubString(text1, text2.substring(1), false));
	    }
	    
	public static boolean isRecycledPair(int a, int b){
		String s1 = Integer.toString(a);
		String s2 = Integer.toString(b);
		if((s1.length() == s2.length()) && s1.length()>0){
			String s1s1 = s1+s1;
			return isSubString(s2,s1s1);
		}
		
		return false;
	}
	
	public static int recycle(int a, int b){
		int n;
		int m;
		int count=0;
		for(n=a;n<b;n++){
			for(m=n+1;m<=b;m++){
				if(isRecycledPair(n,m))
					count++;
			}
		}
		return count;
	}
	
	public static void solve() throws IOException {
		Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt0.out"));
		
		int nbCases = sc.nextInt();
		
		for (int caseNum = 0; caseNum < nbCases; caseNum++) {
			pw.print("Case #" + (caseNum + 1) + ": ");
			
			int a = sc.nextInt();
			int b = sc.nextInt();
			int res = recycle(a,b);
			
			pw.println(res);
		}
		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String args[]) throws IOException{
		solve();
	}

}
