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.util.Formatter;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {	//Counting numbers within a given range, having same sequence of digits 

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();
		for(int i=1;i<=cases;i++){
			int a = in.nextInt();
			int b = in.nextInt();
			int digitCount = new Integer(a).toString().toCharArray().length;
			HashSet<String> pairs = new HashSet<String>();
			
			for(int num=a; num<b; num++){
				char[] numArray = new Integer(num).toString().toCharArray();
				for(int j=1; j<digitCount; j++){
					char[] tempIter = new char[digitCount];
					for(int k=0; k<digitCount; k++)
						tempIter[k] = numArray[(k+j)%digitCount];
					int tempNum = Integer.parseInt(String.valueOf(tempIter));
					if(tempNum > num && tempNum <=b)
						pairs.add(new Formatter().format("[%d, %d]", num,tempNum).toString());
				}
			}
			System.out.println("Case #"+i+": "+pairs.size());
		}
	}

}
