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

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author Masilo
 */
public class RecycledNumbers {

    public static void main(String[] args) {
        Scanner inputStream = null;
        PrintWriter outputStream = null;
      
        try{
            inputStream = new Scanner(new FileInputStream("input.txt"));
            outputStream = new PrintWriter(new FileOutputStream("output.txt"));
            
            int t = Integer.parseInt(inputStream.nextLine());
            String outputLine = "";
            String[] inputNumbers = null;
            int numberOfRecycledPair =0;
            int number =0, length =0;
            
            
            for (int i = 1; i<=t;i++){
                inputNumbers = inputStream.nextLine().split(" ");
                numberOfRecycledPair = 0;
                outputLine = "Case #"+i+": ";
                ArrayList<String> pairs = new ArrayList<String>();
                
                length = inputNumbers[0].length();
                if (length >1){
                    for (int n = Integer.parseInt(inputNumbers[0]);n<Integer.parseInt(inputNumbers[1]);n++){
                        for (int j = 1;j<length;j++){
                            number = Integer.parseInt(Integer.toString(n).substring(length-j)+Integer.toString(n).substring(0,length-j));
                            if (number>n && number<=Integer.parseInt(inputNumbers[1]))
                                if (!(pairs.contains(n+":"+number))){
                                    numberOfRecycledPair++;
                                    pairs.add(n+":"+number);
                                }
                        }
                    }
                }
                outputLine += ""+numberOfRecycledPair;
                outputStream.println(outputLine);
            }
            
            outputStream.close();
            inputStream.close();
            
        }
        catch(Exception e){
            System.out.println("file input.txt was not found");
        }
    }
}
