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 br.com.codejam.qualification;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		String file = "C-small-attempt1";
		Scanner sc = new Scanner(new FileReader(file + ".in"));
		PrintWriter pw = new PrintWriter(new FileWriter(file + ".out"));
		int T = new Integer(sc.nextLine());
		Map<Map<String, String>, String> mapAll = new HashMap<Map<String, String>, String>();
		Map<String, String> map = new HashMap<String, String>();

		int h = 1;
		for (int t = 1; t <= T; t++) {
			String line = sc.nextLine();
			String[] numbers = line.split(" ");
			mapAll = new HashMap<Map<String, String>, String>();
			int A = new Integer(numbers[0]);
			int B = new Integer(numbers[1]);
			if ((String.valueOf(A)).length() > 1) {
				
				for (int i = B; i > A; i--) {
					for (int j = A; j < i; j++) {
						String auxA = String.valueOf(j);
						for (int m = 0; m < auxA.length(); m++) {
							if (auxA.charAt(0) != '0') {
								if (new Integer(auxA) == i) {
									map = new HashMap<String, String>();
									map.put(String.valueOf(j),
											String.valueOf(i));
									mapAll.put(map, "sucesso");
								}
							}
							StringBuilder sb = new StringBuilder();
							sb.append(auxA.charAt(auxA.length() - 1));
							sb.append(auxA.substring(0, auxA.length() - 1));
							auxA = sb.toString();
						}
					}
				}
			}			
			pw.print("Case #" + h + ": ");
			pw.println(mapAll.size());
			/*for(Map<String, String> m : mapAll.keySet()) {
				for(String s : m.keySet()) {
					pw.print(s + " - ");
					pw.println(m.get(s));
				}
			}
			pw.println("###########################");
			pw.println();*/
			h++;

		}
		pw.flush();
		pw.close();
		sc.close();
	}

}
