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.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;


public class main2 {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader m = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter ou = new PrintWriter("file.txt");
		int n = Integer.parseInt(m.readLine());
	
		for (int i = 0; i < n; i++) {
			String cas = m.readLine();
			String [] a = cas.split(" ");
			int base = Integer.parseInt(a[0]);
			int count = 0;
			int count1=0;
			if(a[0].length()==1){
				System.out.print("Case #"+(i+1)+": "+count);

				System.out.print("\n");
			}else{
				Boolean con = false;;
				int cass = Integer.parseInt(a[0]);
				do {
//					 con = false;;
//				String newcase = a[0].charAt(0)+"";
//				for(int j=0  ;j<a[0].length()-1;j++ ){
//					newcase +=a[0].charAt(0)+"";;
//				}
		
				do{
					
					count1 = count;
					
					String newcase = cass+"";
					if (cass <Integer.parseInt(a[1])){
						con = true;
						for (int j = 0; j < newcase.length()-1; j++) {
							newcase = (newcase+newcase.charAt(0));
							newcase = newcase.substring(1,newcase.length());
							int cassM = Integer.parseInt(newcase);
							if (base <= cass && cass < cassM && cassM<=Integer.parseInt(a[1]))
								count++;
						}
					}
					cass++;
				}while(count1 <count);
				
//					String tmp = cass+"";
//					int first = Integer.parseInt(tmp.charAt(0)+"");
//					first++;
//					tmp = first+""+tmp.substring(1,tmp.length());
//					a[0]=tmp;
				
				}while(cass <= Integer.parseInt(a[1]));
				System.out.print("Case #"+(i+1)+": "+count);

				System.out.print("\n");
			}
		}
	}

}
