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

import java.util.ArrayList;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int t = 1;
		int a, b;
		ArrayList<Integer>[] v = new ArrayList[2000010];
		for (int i = 0; i < v.length; i++)
			v[i] = new ArrayList<Integer>();
		while (n-- > 0) {
			a = in.nextInt();
			b = in.nextInt();
			int cnt = 0;
			int x;
			String s = a + "";
			int len = s.length();
			int pow = 1;
			for (int i = 0; i < len - 1; i++)
				pow *= 10;
			for (int i = a; i <= b; i++)
				v[i].clear();
			for (int i = a; i <= b; i++) {
				x = i;
				for (int j = 0; j < len; j++) {
					if (x % 10 == 0) {
						int tm = 10;
						while (x % tm == 0) {
							tm *= 10;
						}
						x = (x % tm) * pow / (tm / 10) + x / (tm);
						if (x > i && x <= b && !v[i].contains(x)) {
							cnt++;
							v[i].add(x);
						}
					} else {
						x = (x % 10) * pow + x / 10;
						if (x > i && x <= b && !v[i].contains(x)) {
							cnt++;
							v[i].add(x);
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", t++, cnt);
		}
	}

}