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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	private static void checkInputFile(String filePath) throws IOException{
		BufferedReader br=new BufferedReader(new FileReader(new File(filePath)));
		PrintWriter output=new PrintWriter(filePath.concat(".out"));
		
		String str=new String();
		int row=0;
		
		while((str=br.readLine())!=null){
			if(row!=0){
				int as=checkOneline(str);
				output.println("Case #"+row+": "+as);
			}
			row=row+1;
		}
		output.close();
		br.close();
	}
	
	private static int checkOneline(String str) {
		int as=0;
		int minNumb=0;
		int maxNumb=0;
		
		//å°ä¸è¡æ°å­çå­ç¬¦ä¸²è½¬ä¸ºæ´åList;
		List<Integer> iLst=getIntLstFromString(str);
		
		minNumb=iLst.get(0);
		maxNumb=iLst.get(1)+1;
		
		for(int a=minNumb;a<maxNumb+1;a++){
			String tst=String.valueOf(a);
			Set<Integer> is=new HashSet<Integer>();
			for(int i=1;i<tst.length();i++){
				String str1=tst.substring(0, i);
				String str2=tst.substring(i);
				int a1=Integer.valueOf(str2.concat(str1));
				is.add(a1);
			}
			for(Iterator<Integer> it=is.iterator();it.hasNext();){
				int a1=it.next();
				if(a1>a && a1<maxNumb){
					as=as+1;
				}
			}
		}
		
		return as;
	}

	private static List<Integer> getIntLstFromString(String str){
		//å°ä¸è¡æ°å­çå­ç¬¦ä¸²è½¬ä¸ºæ´åList;
			List<Integer> iLst=new ArrayList<Integer>();
			int j=0;
			for(int i=0;i<str.length();i++){
				if(str.substring(i, i+1).equals(" ")){
					iLst.add(Integer.valueOf(str.substring(j, i)));
					j=i+1;
				}
			}
			iLst.add(Integer.valueOf(str.substring(j, str.length())));
			return iLst;
	}
	public static void main(String args[]) throws IOException{
		Scanner scanner=new Scanner(System.in);
		String inputFilePath=scanner.nextLine();
		checkInputFile(inputFilePath);
	}
}
