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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;


public class RecyclingNumbers {
	private boolean[] m_numArray;
	private int[] chooseArray = {0, 0, 1, 3, 6, 10, 15, 21, 28};
	private int m_low;
	private int m_high;
	
	RecyclingNumbers(int low, int high){
		m_numArray = new boolean[high-low+1];
		Arrays.fill(m_numArray, false);
		m_low = low;
		m_high = high;
	}
	
	public int getPairsCount(){
		
		int m_pairsCount = 0;
		int tempCount = 0;
		
		for(int i=m_low; i<=m_high; i++){
			
			if(m_numArray[i-m_low] == true){
				continue;
			}
			
			String curNumS = String.valueOf(i);
			int intLength = curNumS.length();
			
			if(intLength == 1){
				continue;
			}
			
			for(int j=1; j<intLength; j++){
				String temp = curNumS.substring(intLength-1, intLength);
				String front = curNumS.substring(0, intLength-1);
				curNumS = temp + front; 
				
				int tempInt = Integer.parseInt(curNumS);
				
				if(tempInt>=m_low && tempInt <= m_high && tempInt != i && curNumS.length() == intLength && m_numArray[tempInt-m_low] == false){
					tempCount++;
					m_numArray[tempInt-m_low] = true;
				}
			}
			
			if(tempCount > 0){
				m_numArray[i-m_low] = true;
				m_pairsCount += chooseArray[tempCount+1];
			}
			
			tempCount = 0;
			
		}
		
		return m_pairsCount;
	}
	
	
	public static void main(String[] args) {
		
		try {
			// Code for accessing the file goes here
			FileReader dataFile = new FileReader("/Users/benedictliang/Documents/workspace/CodeJam2012/src/C-small-attempt0.in");
			BufferedReader bufferedDataFile = new BufferedReader(dataFile);
			String num = bufferedDataFile.readLine();
			int numOfLines = Integer.parseInt(num);
			
			BufferedWriter out = new BufferedWriter(new FileWriter("/Users/benedictliang/Documents/workspace/CodeJam2012/src/output.txt"));
			
			
			for(int i=1; i<=numOfLines; i++){
				String line = bufferedDataFile.readLine();
				String[] data = line.split(" ");
				int num1 = Integer.parseInt(data[0]);
				int num2 = Integer.parseInt(data[1]);
				
				RecyclingNumbers rn = new RecyclingNumbers(Math.min(num1, num2), Math.max(num1, num2));
				out.write("Case #" + i + ": " + rn.getPairsCount() + "\n");
			}
			
			dataFile.close();
			out.close();
		} catch (Exception e) {
			System.out.println(e);
		}
		
	}
}
