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));
	}
}

import java.io.PrintWriter;
import java.util.Scanner;


public class Codejam {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner inFile = null;
	    PrintWriter outFile = null;
	    inFile = FileUtils.ScannerOpen("zin");
	    outFile = FileUtils.PrintWriterOpen("zout");
	    int numberOfTestCase=0;
	    //get the number of test cases
	    if(inFile.hasNext()){
	    	String s=inFile.nextLine();
	    	try{
	    		numberOfTestCase=Integer.parseInt(s);
	    	}catch(Exception e){
	    		
	    	}
	    }
	    
	    //for each test case get the input
	    for(int i=0;i<numberOfTestCase;i++){
	    	Solver s=new Solver(i+1);
	    	s.processInput(inFile, outFile);
	    }
	    inFile.close();
	    outFile.close();
	    System.out.println("Done");
	}

}