import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
package codejam;

import java.util.ArrayList;

public class RecycledNumbers {

	public static void recycled(String in,String out){
		InOutTool iot = new InOutTool(in,out);
		ArrayList<String> js = new ArrayList<String>();
		for(int i=1;i<iot.size();i++){
			int count = 0;
			String s = iot.get(i).trim();
			String[] num = s.split(" ");
			int f = Integer.parseInt(num[0]);int l = Integer.parseInt(num[1]);
			int n = f+1;
			while(n<=l){
				String ns = String.valueOf(n);
				if(ns.length()>1){
					ArrayList<String> list = new ArrayList<String>();
					for(int k=ns.length()-1;k>0;k--){
						String temp = ns.substring(k) + ns.substring(0, k);//move
						if(!temp.startsWith("0")){
							int t = Integer.parseInt(temp);
							if(t<n&&t>=f&&(String.valueOf(t).length()==ns.length())&&(!list.contains(String.valueOf(t)))){
									list.add(String.valueOf(t));
									count ++;
							}
						}
					}
				}
				n++;
			}
			js.add("Case #" + i + ": " + count);
		}
		iot.clear();iot.addAll(js);
		System.out.println(iot.outText());
	}
	
	public static void main(String...args){
		RecycledNumbers.recycled("C-small-attempt0.in", "C-small-attempt0.out");
	}
}
