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 codejam2.recycled;

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

import codejam2.CodejamCase;
import codejam2.CodejamRunner;

public class Recycled extends CodejamRunner implements CodejamCase {
	private int min;
	private int max;
	private String result;
	@Override
	public void compute() {
		int r = 0;
		for(int i = min; i <= max; i++) {
			HashSet<String> ss = new HashSet<String>();
			String s = String.valueOf(i);
			for(int j = 1; j < s.length(); j++) {
				String n = s.substring(j) + s.substring(0, j);
				int in = Integer.valueOf(n);
				if (in > i && in <= max) {
					ss.add(n);
				}
			}
			r += ss.size();
		}
		result = String.valueOf(r);
	}

	@Override
	public String getOutput() {
		return result;
	}

	@Override
	public CodejamCase parseCase(Scanner s) {
		Recycled r = new Recycled();
		r.min = s.nextInt();
		r.max = s.nextInt();
		return r;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Recycled().run(args);
	}

}
