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.Arrays;
import java.util.List;
import java.util.Set;
import java.util.TreeSet;


public class NumberQueue {
	String number;
	
	public NumberQueue(int number) {
		this.number = number + "";
	}
	
	public void cycle() {
		char front = number.charAt(0);
		number = number.substring(1) + front;
	}
	
	public List<Pair> distinctRoations(int min, int max) {
		List<Pair> pairs = new ArrayList<Pair>();
		String original = number;
		int origNum = toInteger();
		for(int i = 0; i < number.length(); i++) {
			if(!number.equals(original)) {
				// check bounds
				int numInt = toInteger();
				if(numInt >= min && numInt <= max) {
					Pair ap = new Pair(origNum, numInt);
					if(!pairs.contains(ap)) {
						pairs.add(ap);
					}
				}
				cycle();
			} else {
				cycle();
			}
		}
		number = original;
		return pairs;
	}
	
	public int toInteger() {
		return Integer.valueOf(number);
	}
	
	public class Pair implements Comparable<Pair>{
		public int first;
		public int second;
		
		public Pair(int f, int s) {
			first = f;
			second = s;
		}
		
		// override default equals
		public boolean equals(Object o) {
			Pair other = (Pair) o;
			return (first == other.first && second == other.second) || (first == other.second && second == other.first);
		}
		
		public String toString() {
			return "" + first + "<=>" + second;
		}
		
		// compare to for ordering - mostly debugging
		public int compareTo(Pair other) {
			if(equals(other)) {
				return 0;
			} else {
				return first - other.first;
			}
		}
	}
}
