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.google.codejam.C;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class Recycled {
	public static void main(String[] args) {
		String line = null;
		BufferedReader reader = null;
		File file = new File("c:\\write.txt");
		BufferedWriter  output = null;
		try {
			output = new BufferedWriter(new FileWriter(file));
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		
		try {
			reader = new BufferedReader(new FileReader("c:\\temp1.txt"));
			line = reader.readLine();
			int n = Integer.parseInt(line);
			for (int i=0;i<n;i++){
				line = reader.readLine();
				output.write("Case #"+(i+1)+": ");

				String[]arr = line.split(" ");
				int intarr[]= new int[arr.length];
				for (int j=0;j<intarr.length;j++){
					intarr[j]= Integer.parseInt(arr[j]);
				}
				int count =0;
				int n1 = intarr[0];
				int n2= intarr[1];
				Set<Pair > set = new HashSet<Pair>();
				for (int number=n1;number<=n2;number++){
					int digitarr[] = new int[8];
					int numberOfDigits = 0;
					int no = number;
					while (no >0 ){
						int d = no%10;
						no = no/10;
						digitarr[numberOfDigits]=d;
						numberOfDigits++;
					}
					if (numberOfDigits==1){
						continue;
					}
					for (int j=0;j<numberOfDigits/2;j++){
						int temp = digitarr[j];
						digitarr[j]= digitarr[numberOfDigits-j-1];
						digitarr[numberOfDigits-j-1]=temp;
					}
					
					for (int j=0;j<numberOfDigits;j++){
						int sum =0;
						if (digitarr[j]==0){
							continue;
						}
						for (int k=0;k<numberOfDigits;k++){
							int pos = (j+k)%numberOfDigits;
							int d = digitarr[pos];
							sum=(int) (sum+ (Math.pow(10, (numberOfDigits-k-1))*d ));
							if (sum>n2){
								break;
							}
						}
						if (sum<=n2 && sum> number){
							if (set.contains(new Pair(sum,number))){
//								System.out.println(number +" "+ sum);
								continue;
							}
							
							set.add(new Pair(sum,number));
							count++;
						}
					}
				}
				output.write(count+"");
				
				if (i!=n-1)
				output.write("\n");
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}finally{
			try {
				reader.close();
				output.close();
			
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
				
	}
}
class Pair{
	int a;
	int b;
	public Pair(int sum, int number) {
		a = sum;
		b = number;
	}
	@Override
	public boolean equals(Object obj) {
		Pair p = (Pair)obj;
		if (p.a==a && p.b==b){
			return true;
		}
		if (p.b==a && p.a==b)
			return true;
		return false;
	}
	@Override
	public int hashCode() {
		return ((a+b)%13);
	}
}
