import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

package codejam;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class QualificationC extends CodeJam {

	public QualificationC(String file) throws Exception {
		super(file);
	}
	
	@Override
	public Object processCase(int caseNumber) throws Exception {
		String readLine = readLine();
		String[] split = readLine.split(" ");
		int a = Integer.parseInt(split[0]);
		int b = Integer.parseInt(split[1]);
		
		Set<String> found = new HashSet<String>();
		
		for (int i = a; i <= b; i++) {
			char[] n = (i+"").toCharArray();
			
			int cN = i;
			String cM = i+"";
		      
			int len = n.length;
			for (int j = 0; j < len; j++) {
				cM = cM.substring(len-1) + cM.substring(0, len - 1);
				int intCm = Integer.parseInt(cM);
				if (intCm <= b && intCm > cN && intCm >= a) {
					found.add(cN+' '+cM);
		        }
			}
		}
		
		return found.size();
		
	}
	
	public static void main(String[] args) throws IOException,
			InterruptedException, Exception {
		
		new QualificationC("C-small-attempt0.in").start();

	}
	
	
}
