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.io.*;
import java.util.Scanner;

public class C_2012 {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test.out")));
		
		int c = in.nextInt();
		
		for(int cases=0;cases<c;cases++){
			
			int A = in.nextInt();
			int B = in.nextInt();
			int C = 0;
			
			for(int i=A;i<B;i++){
				
				for(int j=i+1;j<=B;j++){
					
					int n = String.valueOf(i).length();
					for(int k=1;k<n;k++){
						String I = String.valueOf(i);
						int ip = Integer.parseInt(I.substring(n-k, n)+I.substring(0, n-k));
						if(ip==j) {
							C++;
							break;
						}
					}
				}					
			}
			
		out.println("Case #"+(cases+1)+": "+C);
			
		}
		out.close();
		System.exit(0);
	}
}
