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

import java.io.File;
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 {

	private static final class IntPair {
		Integer a, b;
		IntPair(Integer a,Integer b) {
			this.a = a;
			this.b = b;
		}
		@Override
		public boolean equals(Object obj) {
			IntPair other = (IntPair) obj;
			return a.equals(other.a) && b.equals(other.b);
		}
		@Override
		public int hashCode() {
			return a.hashCode() * b.hashCode();
		}
		
	}
	
	private static Map<IntPair, Object> beenThereDoneThat;
	
	public static void main(String[] args) throws IOException {
		Scanner scn = new Scanner(new File("C-small-attempt0.txt"));
		PrintWriter output = new PrintWriter(new FileWriter("out1.txt"));
		int size = scn.nextInt();
		for (int i = 1; i <= size; i++) {
			int total = 0;
			int a = scn.nextInt();
			int b = scn.nextInt();
			for (int j = a; j <= b; j++) {
				total += count(j, b);
			}
			output.write("Case #" + i + ": " + total);
			output.write('\n');
		}
		output.close();
	}
	
	private static int count(Integer curr, Integer max) {
		String currString = curr.toString();
		int currSize = currString.length();
		if (currSize == 1) {
			return 0;
		}
		beenThereDoneThat = new HashMap<IntPair, Object>();
		int localCount = 0;
		//i is start index of end part, which is moving to the front
		for (int i = 1; i < currSize; i++) {
			String newCurr = currString.substring(i) + currString.substring(0, i);
			int newCurrInt = Integer.valueOf(newCurr);
			if (newCurrInt > curr && newCurrInt <= max) {
				IntPair pair = new IntPair(curr, newCurrInt);
				if (beenThereDoneThat.get(pair) == null) {
					beenThereDoneThat.put(pair, new Object());
					localCount++;
				}
				
//				if (localCount == 1) {					
//					System.out.print(curr);
//				}
//				System.out.print(" "+newCurrInt);
			}
		}
//		if (localCount !=0) {			
//			System.out.println();
//		}
		return localCount;
	}
	
	
}
