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

public class Main {

	public static void main(String[] args) {
		List<String> lstLinesOutput = new ArrayList<String>();
		int iNbAnswers;
		List<String> lstLinesInput = FileReaderHandler.openFile("/home/guillaume/Bureau/input");
		
		
		for(int n=1;n< Integer.parseInt(lstLinesInput.get(0)) + 1;n++){
			String sOutput = "Case #" + n + ": ";
			List<String> box = new ArrayList<String>();
			iNbAnswers = 0;
			String sInput = lstLinesInput.get(n);
			String[] hInput = sInput.split(" ");
			//to int array
			int[] iInput = new int[hInput.length];
			for(int i=0;i < hInput.length;i++){
				iInput[i] = Integer.parseInt(hInput[i]);
			}
			
			int iMin = iInput[0];
			int iMax = iInput[1];
			for(int i=iMin;i<iMax + 1;i++){
				String s = "" + i;
				for(int j=1; j<s.length();j++){
					String depl = s.substring(s.length() -j);
					String sRecycled = depl + s.substring(0, s.length() - j);
					int iToTest = Integer.parseInt(sRecycled);
					if(iToTest <= iMax && iToTest > i && !box.contains(i + "-" + iToTest)){
						box.add(i + "-" + iToTest);
						iNbAnswers++;
					}
				}
			}
			sOutput += iNbAnswers;
			lstLinesOutput.add(sOutput);
		}
		
		if(Integer.parseInt(lstLinesInput.get(0)) != lstLinesOutput.size()){
			System.out.println("ERROR!!!");
		}
		FileWriterHandler.writeToFile(lstLinesOutput);
	}
}