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.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;



public class RecycledNumbers {

	static String inputLargeFile = "C-large.in";
	static String inputSmallFile = "C-small-attempt0.in";
	
	static String outSmallFile = "C-small-attempt0.out";
	static String outLargeFile = "C-large.out";
	
	static BufferedReader br ;
	static PrintWriter out ;
	public static void main(String[] args) throws Exception{
		
		br = new BufferedReader(new InputStreamReader(new FileInputStream(inputSmallFile)));
		out = new PrintWriter(new File(outSmallFile));
		
		String input = br.readLine();
		
		int testcases = Integer.parseInt(input.trim());
		
		for (int i = 0; i < testcases; i++) {
			   String range =  br.readLine();
			   String[] numbers = range.split(" ");
			     
			   int A = Integer.parseInt(numbers[0].trim());
			   int B = Integer.parseInt(numbers[1].trim());
               String part1=null;
               String part2=null;
               int count=0;
               int m =0;
               int endIndex =0;
               int beignIndex=0;
               
               String number = null; 
               String pair = null;
               
			   for(int n=A;n<=B;n++ ){      
		               
		              number = String.valueOf(n);
		              endIndex = number.length()-1;
		              
		             int last=0;
					 for(int p=endIndex;p>0;p--){
						 
						pair =  number.substring(p)+number.substring(beignIndex,p);
					    m=Integer.parseInt(pair); 
						
					  
					    if(m>n&&m<=B&&m!=last){
							
							count++;
							last=m;
							
							//out.println("count : " + count);
						}
					 
					 } 
				   }
				   
			   out.println("Case #"+ (i+1)+ ": " + count);	   
		}
			   
			   
			
			 	   				   
		out.close();
		br.close();
	   
			
		}
		
		
	}


