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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.StringTokenizer;

public class ThirdProblem {
	private int a;
	private int b;
	private int number;
	private HashMap<Integer,HashMap<Integer, Boolean>> hash;


	public ThirdProblem(int a,int b){
		this.a=a;
		this.b=b;
		hash=new HashMap<Integer, HashMap<Integer,Boolean>>();
		for(int i=a;i<=b;i++){
			calculateCouples(i);
		}
	}


	private void calculateCouples(int n) {		
		String original=n+"";		
		for(int i=original.length()-1;i>0;i--){
			String pre=original.substring(i);
			String post=original.substring(0,i);
			int m=Integer.parseInt(pre+post);
			if(m>n && m<=b){
				HashMap<Integer, Boolean> mm=hash.get(m);
				if(mm==null)
					mm=new HashMap<Integer, Boolean>();
				if(mm.get(n)==null){
					mm.put(n, true);
					hash.put(m, mm);
					number++;
				}
			}
		}

	}
	public int getNumber() {
		return number;
	}

	public static void main(String[] args) throws Exception {
		File input=new File("input3"+File.separatorChar+"input2.in");
		File output=new File("output3"+File.separatorChar+"output2.txt");
		PrintWriter pw=new PrintWriter(new OutputStreamWriter(new FileOutputStream(output)));

		BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream(input)));
		br.readLine();
		String current=br.readLine();
		int cont=1;
		while(current!=null && current.trim().length()!=0){
			StringTokenizer st=new StringTokenizer(current," ");
			int a=Integer.parseInt(st.nextToken());
			int b=Integer.parseInt(st.nextToken());
			int number=new ThirdProblem(a, b).getNumber();
			pw.append("Case #"+cont+": "+number);
			cont++;
			current=br.readLine();
			if(current!=null)
				pw.append("\n");
			pw.flush();
		}
		System.out.println("Finished");
	}


}
