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;
	}

}

package com.google.codejam;

import static java.math.BigInteger.ONE;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;

public class RotatingNumbers {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		new RotatingNumbers().run();
	}

	private int count(BigInteger minValue, BigInteger maxValue) {
		BigInteger currentNumber = minValue;
		int counter = 0;
		
		while (!maxValue.equals(currentNumber)) {
			BigInteger candidate = null;
			int r = 1;
			while (!currentNumber.equals(candidate)) {
				candidate = rotateLeft(currentNumber, r++);
				if (candidate.compareTo(currentNumber) > 0 && candidate.compareTo(maxValue) <= 0 && candidate.compareTo(minValue) >= 0) {
					counter++;
				}
			}
			currentNumber = currentNumber.add(ONE);
		}
		return counter;
	}

	private void run() throws FileNotFoundException {
		BigInteger[][] data = parseInput("input");
		Integer[] result = solve(data);
		printResult(result, "output");
	}
	
	private Integer[] solve(BigInteger[][] data) {
		Integer[] result = new Integer[data.length];
		for (int i = 0; i < data.length; i++) {
			result[i] = count(data[i][0], data[i][1]);
		}
		return result;
	}

	private BigInteger rotateLeft(BigInteger value, int digits) {
		String stringValue = value.toString(10);
		StringBuilder result = new StringBuilder(stringValue.substring(digits));
		result.append(stringValue.substring(0, digits));
		return new BigInteger(result.toString(), 10);
	}

	private void printResult(Integer[] result, String path) throws FileNotFoundException {
		PrintWriter p = new PrintWriter(new File(path));
		try { 
			for (int i = 1; i < result.length+1; i++) {
				p.format("Case #%d: %d\n", i, result[i-1]);
			}
		} finally {
			p.close();
		}
	}

	private BigInteger[][] parseInput(String path) throws FileNotFoundException {
		Scanner scanner = new Scanner(new File(path));
		try {
			BigInteger[][] input = new BigInteger[scanner.nextInt()][2];
			scanner.nextLine(); // skip to the next line
			for (int i = 0; i < input.length; i++) {
				input[i][0] = new BigInteger(scanner.next());
				input[i][1] = new BigInteger(scanner.next());
//				scanner.nextLine();
			}
			return input;
		} finally {
			scanner.close();
		}
	}
}
