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.util.ArrayList;
import java.util.Scanner;


public class RecycleNumber {

	/**
	 * @param args
	 */
	int NoOfTestCase = 0;
	int A = 0;
	int B = 0;
	ArrayList<Integer> knownList = new ArrayList<Integer>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub 
		RecycleNumber rn = new RecycleNumber();
		Scanner sc = new Scanner(System.in);
		rn.NoOfTestCase = Integer.parseInt(sc.nextLine());
		for(int i=0;i<rn.NoOfTestCase;i++)
		{
			String input = sc.nextLine();
			String[] inputArr = input.split(" ");
			rn.A = Integer.parseInt(inputArr[0]);
			rn.B = Integer.parseInt(inputArr[1]);
			System.out.println("Case #"+(i+1)+": "+rn.solve());
		}
	}
	private int solve()
	{
		int result = 0;
		Integer currInt = 0;
		Integer newInt = 0;
		Integer temp = 0;
		String resultStr = "";
		boolean firstTime = true;
		for(int i=A;i<=B;i++)
		{
			currInt = i;
			if(true)
			{
				newInt = currInt;
				resultStr = newInt.toString();
				firstTime = true;
				while((newInt.compareTo(currInt)!=0) || firstTime)
				{
					temp = newInt;
					resultStr = rotate(resultStr);
					newInt = Integer.parseInt(resultStr);
					if(A>=newInt)
					{
						while(newInt>A)
						{
							newInt = temp;
							resultStr = rotate(resultStr);
							newInt = Integer.parseInt(resultStr);
						}
					}
					if(newInt>currInt)
					{
						if(A< newInt && B >= newInt)
						{
							knownList.add(newInt);
							result++;
						}
					}
					firstTime = false;
				}
			}
		}
		return result;
	}
	private String rotate(String s){
		String[] str = s.split("");
		String last = str[str.length-1];
		for(int i=str.length-1;i>1;i--)
		{
			str[i] = str[i-1];
		}
		str[1] = last;
		String result = "";
		for(int i=1;i<str.length;i++)
			result = result+str[i];
		return result;
	}

}
