import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashMap;
import java.util.Scanner;

public class CodeJam2012Ex3 {
	public static void main(String arg[]) throws FileNotFoundException {
		File file = new File("C-small-attempt1.in");
		String output;
		Scanner scanner = new Scanner(file);
		int numTestCases = scanner.nextInt();

		for (int i = 0; i < numTestCases; i++) {
			StringBuffer buffer = new StringBuffer("Case #" + (i + 1) + ": ");
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			buffer.append(CodeJam2012Ex3.countPairs(A, B));
			if (i != numTestCases - 1) {
				buffer.append("\n");
			}
			output = buffer.toString();

			System.out.print(output);
		}

	}

	public static int countPairs(int A, int B) {
		int pairs = 0;
		HashMap<String, Boolean> map = new HashMap<String, Boolean>();

		for (int i = A; i <= B; i++) {

			String n = i + "";

			int len = n.length();
			for (int j = 1; j < len; j++) {
				String m = n.substring(len - j) + n.substring(0, len - j);
				int nNum = Integer.parseInt(n);
				int mNum = Integer.parseInt(m);
				if (nNum < mNum && n.length() == (mNum + "").length()
				&& mNum <= B && !map.containsKey((n + m))) {
					map.put(n + m, (Boolean) true);
					pairs++;
				}
			}
		}
		return pairs;

	}
}
