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 ch7.rec;

import java.util.HashSet;
import java.util.Scanner;

public class Recycled {
	
	static HashSet p = new HashSet();
	
	int count = 0;
	public static void main(String[] args) {		
		
		Scanner sc = new Scanner(System.in);		
		int no = sc.nextInt();
		
		for(int i = 1; i <= no; i++) {
			
			p.clear();
			int low = sc.nextInt();
			int high = sc.nextInt();
			
			for(int l = low; l <= high; l++) {
				recycle(low, high, l);
			}
			System.out.println(p.size());
			
		}		
	}
	
	public static void recycle(int low, int high, int no) {
		
		String s = Integer.toString(no);
		for(int i = 0 ; i < s.length(); i++) {			
			String rec = s.substring(i) + s.substring(0,i);
			int r = Integer.parseInt(rec);
			if(r != no && r >= low && r <= high) {		
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min)+""+Integer.toString(max);
				if(!(p.contains(a))) {
					p.add(a);
				}
				
			}
		}
		
	}
}