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 google.contest.C;

import google.loader.Challenge;
import google.problems.AbstractChallenge;

import java.util.HashSet;
import java.util.Set;

public class CChallenge extends AbstractChallenge implements Challenge {

	private int B;
	private int A;
	private int num;
	Set<String>pairs ;
	public CChallenge(int number, String line) {
		super(number);
		num=0;
		
		pairs = new HashSet<String>();
		
		String[] tokens = line.split(" ");

		A = Integer.parseInt(tokens[0]);
		B = Integer.parseInt(tokens[1]);
		int i=0;
		for( i=A ; i<=B; i++){
			calcFor(i);
		}
		
		setResult(""+num);
	}

	private void calcFor(int i) {
		String numString = ""+i;
		
		for(int j=1; j<= numString.length()-1; j++){
			String first = numString.substring(0,j);
			String second = numString.substring(j);
			String third = second+first;
			check(i, third);
			
		}
	}

	private void check(int i, String third) {
		if(third.startsWith("0")){
			return;
		}
		int j = Integer.parseInt(third);
		if(A<=i && i<j && j<=B){
			
			String hlp = ""+i+j;
			if(! pairs.contains(hlp)){
				pairs.add(hlp);
				num++;
			}else{
				System.out.println(""+num+"  "+i+"  "+j);
			}
		}
	}
}
