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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;

public class recycledNumbers {
	
	public static void main(String[] args)
	{
		File inputFile = new File("input/" + args[0]);
		
		if (!inputFile.exists())
		{
			System.out.print("File DNE");
			return;
		}
		
		BufferedReader br = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
			
			Integer caseCount = new Integer(br.readLine());
			Integer[] lowerList = new Integer[caseCount];
			Integer[] upperList = new Integer[caseCount];
			
			for (int i = 0; i < caseCount; i++)
			{
				String[] lineIn= br.readLine().split(" ");
				lowerList[i] = new Integer(lineIn[0]);
				upperList[i] = new Integer(lineIn[1]);
			}
			
			File outputFile = new File("output/" + args[0] + ".out");
			FileWriter fw = new FileWriter(outputFile);
			
			for (int i = 0; i < caseCount; i++)
			{
				foundPairs.clear();
				int finalCount = 0;
				Integer val = lowerList[i];
				while (val <= upperList[i])
				{
					finalCount += rotate(val, lowerList[i], upperList[i]);
					val++;
				}
				System.out.println("Case #" + (i + 1) + ": " + finalCount);
				fw.write("Case #" + (i + 1) + ": " + finalCount + "\n");
			}
			
			fw.close();
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
	}
	
	private static Map<String,Boolean> foundPairs = new HashMap<String, Boolean>();
	
	private static int rotate(Integer val, Integer lowerBound, Integer upperBound)
	{
		char[] valString = val.toString().toCharArray();
		
		List<Character> valCharArray = new ArrayList<Character>(valString.length);
		
		for (int i = 0; i < valString.length; i++)
			valCharArray.add(valString[i]);
		
		int finalCount = 0;
		for (int i = 0; i < valString.length; i++)
		{
			valCharArray.add(valCharArray.remove(0));
			
			String testValString = new String("");
			for (int j = 0; j < valCharArray.size(); j++)
				testValString += valCharArray.get(j);
			
			Integer testVal = new Integer(testValString);
			
			String key1 = val.toString() + "_" + testVal.toString();
			String key2 = testVal.toString() + "_" + val.toString();
			if (foundPairs.get(key1) != null || foundPairs.get(key2) != null)
				continue;
			
			
			if (testVal > val && testVal <= upperBound)
			{
				foundPairs.put(key1,true);
				foundPairs.put(key2,true);
				
				finalCount++;
			}
		}
		return finalCount;
	}
}
