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 com.code.jam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class RecycledNumbers {

	FileInputStream in;
	FileOutputStream out;
	BufferedReader br;

	void open() throws IOException {
		in = new FileInputStream(new File(
				"/home/lenovo/Documents/GCJ/C-small-attempt0.in"));
		out = new FileOutputStream(new File(
				"/home/lenovo/Documents/GCJ/C-small-attempt0.out"));

		br = new BufferedReader(new InputStreamReader(new DataInputStream(in)));

	}

	void close() throws IOException {
		out.close();
	}

	void run() throws IOException {
		int tn = new Integer(br.readLine());
		for (int i = 1; i <= tn; i++) {

			// System.out.println(br.readLine());
			String AB = br.readLine();
			BigInteger A = new BigInteger(AB.split(" ")[0]);
			BigInteger B = new BigInteger(AB.split(" ")[1]);

			int count = 0;
			Map nm = new HashMap();
			
			
			
			for (BigInteger k = A; k.compareTo(B) ==  -1; k = k
					.add(BigInteger.ONE)) {

				String n = k.toString();
				String	m = n;
				nm.clear();
				
				
				for(int l=0;l<n.length();l++)
				{
							m  = rotateDigitRight(m);
					
							BigInteger mBig = new BigInteger(m);
					
						if (mBig.compareTo(k) >0 && mBig.compareTo(B) <= 0 && mBig.compareTo(A) >0 && !nm.containsValue(m) )
						{
							count++;							
							
							nm.put(n, m);
							
							System.out.println(n + ", " +m+"   "+ count);
						
						}	
				}
					
				}
				

							
							
							
			

			out.write(("Case #" + i + ": " + count).getBytes());
			out.write("\n".getBytes());
		}

	}

	public static String rotateDigitRight(String A) {

	
		String val = A.toString();
		
		String val0 = String.valueOf(val.charAt(val.length()-1));
		
		
		
		String valRest = "";
		if(val.length()>=2)
		{
			 valRest = val.substring(0, val.length()-1);
		}

		
		val = val0 + valRest;
		
		
		return val;

	}

	public static void main(String[] args) throws IOException {
		RecycledNumbers solution = new RecycledNumbers();
		solution.open();
		solution.run();
		solution.close();
	}

}
