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 qualification.taskA;

import java.util.HashMap;
import java.util.Map;

import Parser.MyReader;
import Parser.MyWriter;

public class Main {
	public static void main(String[] args) {
		MyReader myReader = new MyReader(
				"/Users/shami13/Downloads/A-small-attempt0.in");
		MyWriter myWriter = new MyWriter("/Users/shami13/Downloads/A-small-attempt0.out");
		
		Map<Character, Character> dictionary = createDictionary();

		int taskLength = Integer.parseInt(myReader.read());

		
		for (int i = 1; i <= taskLength; i++) {
			String taskString = myReader.read();
			Task task = new Task(dictionary);
			String result = task.execute(taskString);
			myWriter.writeString("Case #" + i + ": " + result);
			System.out.println("Case #" + i + ": " + result);
		}
		myWriter.close();
	}

	private static Map<Character, Character> createDictionary() {
		Map<Character, Character> result = new HashMap<Character, Character>();
		result.put('q', 'z');
		result.put('z', 'q');
		
		
		String[] originals = { "ejp mysljylc kd kxveddknmc re jsicpdrysi",
				"rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd",
				"de kr kd eoya kw aej tysr re ujdr lkgc jv" };

		String[] results = { "our language is impossible to understand",
				"there are twenty six factorial possibilities",
				"so it is okay if you want to just give up" };
	
		for(int i = 0; i < originals.length; i++){
			for(int p = 0; p < originals[i].length(); p++){
				if (!result.containsKey(originals[i].charAt(p))){
					result.put(originals[i].charAt(p), results[i].charAt(p));
				}
			}
		}
		
		return result;
	}
}
