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


public class Solver {
	Scanner inFile=null;
	PrintWriter outFile=null;
	int caseNo;
	public Solver(int caseNo){
		this.caseNo=caseNo;
	}
	public void processInput(Scanner inFile,PrintWriter outFile){
		this.inFile=inFile;
		this.outFile=outFile;
		readInput();
		produceoutput();
		
	}
	private void produceoutput() {
       
	
		//outFile.printf("Case #"+caseNo+": %d\n",candidatecount);
		
		
	}
	public void readInput(){
		String s="";
		if(inFile.hasNext()){
			//get the store credit
			int A=Integer.parseInt(inFile.next().trim());
			int B=Integer.parseInt(inFile.next().trim());
			RecycleNumber r=new RecycleNumber(A,B);
			outFile.printf("Case #"+caseNo+": %d\n",r.count);
			if(inFile.hasNext())inFile.nextLine();			
		}
	}

}
