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));
	}
}

import java.util.Scanner;

import jp.ne.sakura.yuki2006.CodeJam.CodeJam;
import jp.ne.sakura.yuki2006.CodeJam.ITestCase;

/**
 *
 */

/**
 * @author yuki
 *
 */
public class RecycledNumbers implements ITestCase {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new CodeJam(new RecycledNumbers(), "Cout.txt");
	}

	/*
	 * (é Javadoc)
	 *
	 * @see jp.ne.sakura.yuki2006.CodeJam.ITestCase#testCase(java.util.Scanner)
	 */
	@Override
	public String testCase(Scanner stdIn) {
		int A = stdIn.nextInt();
		int B = stdIn.nextInt();
		int totalCount = 0;
		for (int i = A; i <= B; i++) {
			int length = String.valueOf(i).length();

			for (int j = 0; j < length; j++) {
				int radix = (int) (Math.pow(10, j));
				int top = i / radix;
				int other = i % radix;

				Integer rn = Integer.parseInt(String.valueOf(other) + String.valueOf(top));

				if (rn<=B && i < rn) {
					System.err.println(i);
					System.err.println(rn);
					System.err.println();
					totalCount++;
				}
			}
		}
		return totalCount + "";
	}
}
