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 com.wordofday.service.job;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;
import java.util.Stack;

public class GoogleRecycle {

	public GoogleRecycle() {
		// TODO Auto-generated constructor stub
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		GoogleRecycle recycle = new GoogleRecycle();
		try{
			  FileInputStream in = new FileInputStream(args[0]);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine = null;
			  int count = 0;
			  while ((strLine = br.readLine()) != null)   {
				  if(count>0){
					  //skip first line
					  if(count>1){
						  System.out.print("\nCase #"+count+": "+recycle.output(strLine));
					  }else{
						  System.out.print("Case #"+count+": "+recycle.output(strLine));
					  }				  }
				  count++;
				  
			  }
			  //Close the input stream
			  in.close();
		}catch(Exception e){
			e.printStackTrace();
		}

	}

	private int output(String strLine) {
		Set<List<Integer>> outputSet = new LinkedHashSet<List<Integer>>();
		int output = 0;
		if(strLine!=null && strLine.trim().length()>0){
			String[] parts = strLine.split(" ");
			int startInt = Integer.parseInt(parts[0]);
			int endInt = Integer.parseInt(parts[1]);
			for(int i=startInt;i<=endInt;i++){
				Stack<Integer> digStack = new Stack<Integer>();
				int temp =i;
				while(temp>0){
					int digit = temp%10;
					digStack.push(digit);
					temp=(temp-digit)/10;
				}
				List<Integer> digList = new ArrayList<Integer>();
				while(!digStack.empty()){
					digList.add(digStack.pop());
				}
				//now start shuffling from stack
				for(int j=1;j<digList.size();j++){
					int nextNumber = getNextNumber(digList,j);
					if(i<nextNumber && nextNumber<=endInt
							&& !String.valueOf(i).startsWith("0")
							&& !String.valueOf(nextNumber).startsWith("0")){
						output++;
						List<Integer> outputList = new ArrayList<Integer>();
						outputList.add(i);
						outputList.add(nextNumber);
						outputSet.add(outputList);
					}
					
				}
				
			}
		}
		return outputSet.size();
	}

	private int getNextNumber(List<Integer> digList, int j) {
		int nextNumber = 0;
		StringBuilder sb = new StringBuilder();
		if(j<digList.size()){
			List<Integer> frontList = digList.subList(0, j);
			List<Integer> endList = digList.subList(j, digList.size());
			for(Integer end:endList){
				sb.append(end);
			}
			for(Integer front:frontList){
				sb.append(front);
			}
			
			nextNumber = Integer.parseInt(sb.toString());
		}
		return nextNumber;
	}

}
