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

public class RecycledNumbersSmall {

	public static void main(String[] args) {

		File file = new File("/Users/NoK/Desktop/C-small-attempt0.in");
		int counter = 1;

		try {
			Scanner sc = new Scanner(file);

			int numOfCases = sc.nextInt();

			sc.nextLine();

			for (int i = 0; i < numOfCases; i++) {
				int integerN = sc.nextInt();
				int integerM = sc.nextInt();
				int numOfRecPairs = 0;
				for (int m = integerN; m <= integerM; m++) {
					String stringM = Integer.toString(m);
					int[] checkerArray = new int[stringM.length()-1];
					for (int j = 0; j < checkerArray.length; j++) {
						checkerArray[j] = -1;
					}
					int index = 0;
					for (int n = 0; n < stringM.length()-1; n++) {
						char tmpChar = stringM.charAt(stringM.length()-1);
						stringM = Character.toString(tmpChar) + stringM.substring(0, stringM.length()-1);
						if (stringM.charAt(0) != '0') {
							int newIntegerM = Integer.parseInt(stringM);
							if ((newIntegerM >= integerN) && (newIntegerM <= integerM)) {
								if (newIntegerM > m) {
									int k = 0;
									boolean exists = false;
									while (k < checkerArray.length) {
										if (checkerArray[k] == newIntegerM) {
											exists = true;
										}
										k++;
									}
									if (exists == false) {
										checkerArray[index] = newIntegerM;
										index++;
										numOfRecPairs++;
									}
								}
							}
						}
					}
				}

				try { 
					FileWriter fw = new FileWriter("/Users/NoK/Desktop/C-small-attempt0.out", true);
					BufferedWriter bw = new BufferedWriter(fw);
					System.out.println("Case #" + counter + ": " + numOfRecPairs);
					bw.write("Case #" + counter + ": " + numOfRecPairs);
					bw.newLine();
					bw.close();
					counter++;
				} catch (Exception e){
					System.err.println("Error: " + e.getMessage());
				}

			}

		} catch (FileNotFoundException e ) {
			e.printStackTrace();
		}

	}

}