import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
package QR_2012;

import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.TreeSet;

public class C {

	static BufferedWriter writer;

	public static void main(String[] args) throws IOException {
		writer = new BufferedWriter(new FileWriter("output.out"));
		Scanner reader = new Scanner(new FileReader("input.in"));
		int nt = reader.nextInt();
		reader.nextLine();
		for(int tc = 1; tc <= nt; tc++) {
			writer.write("Case #" + tc + ": ");
			int a = reader.nextInt();
			int b = reader.nextInt();
			int total = 0;
			for(int n = a; n < b; n++) {
				int count = count(n, b);
				total += count;
			}
			writer.write(Integer.toString(total));
			writer.newLine();
		}
		writer.close();
	}

	static int count(int n, int b) {
		int count = 0;
		String s = Integer.toString(n);
		int l = s.length();
		TreeSet<String> T = new TreeSet<String>();
		for(int i = 1; i < l; i++) {
			s = s.substring(1) + s.charAt(0);
			if(!T.contains(s)) {
				T.add(s);
				int m = Integer.parseInt(s);
				if(n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}


}
