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 problemC;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.Writer;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	public static void main(String[] args) throws Exception {
		
		Writer write = new FileWriter(new File("out.txt"));
		Writer writer = new BufferedWriter(write);
		
		Scanner scan = new Scanner(new File("C-small-attempt0.in.txt"));
		
		int num = scan.nextInt();
		for(int i = 1; i<=num; i++) {
			int lower = scan.nextInt();
			int upper = scan.nextInt();
			int count = 0;
			for(int j = lower; j<upper; j++) {
				Set<String> iterations = iterations(""+j);
				for(int k = j+1; k<=upper; k++) {
					String s = ""+k;
					if(iterations.contains(s)) count++;
				}
			}
			
			writer.write("Case #"+i+": "+count+"\n");
			
		}
		
		writer.close();
		write.close();
		
		
	}
	
	
	public static Set<String> iterations(String in) {
		Set<String> strings = new HashSet<String>();
		
		String current = new String(in);
		strings.add(current);
		for(int i = 0; i<current.length(); i++) {
			String start = current.substring(0, current.length()-1);
			String end = current.substring(current.length()-1);
			
			current = end+start;
			strings.add(current);
		}
		
		//System.out.println(strings);
		
		return strings;
	}

}
