import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class RecycledNumbers {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("C-small-attempt0.in"));
		int numTests = in.nextInt();
		in.nextLine();
		for (int i = 0; i < numTests; ++i) {
			int A = in.nextInt();
			int B = in.nextInt();
			in.nextLine();
			System.out.println("Case #" + (i + 1) + ": " + recycle(A, B));
		}
	}

	private static int recycle(int A, int B) {
		int count = 0;
		for (int n = A; n < B; ++n) {
			String nStr = "" + n;
			count += compareM(n, B, nStr);
		}
		return count;
	}

	private static int compareM(int n, int B, String nStr) {
		int numberOfMGreaterThanN = 0; // and they must be less than B too
		int nStrLength = nStr.length();
		for (int i = 1; i < nStrLength; ++i) {
			String mBegin = nStr.substring(0, nStrLength - i);
			String mEnd = nStr.substring(nStrLength - i, nStrLength);
			String mStr = mEnd + mBegin;
			if (hasSameNumDigits(nStr, mStr)) {
				int m = Integer.parseInt(mStr);
				if (n < m && m <= B) {
					++numberOfMGreaterThanN;
				}
			}
		}
		return numberOfMGreaterThanN;
	}

	private static boolean hasSameNumDigits(String n, String m) {
		boolean foundFirstNonZero = false;
		int numDigitsOfN = 0;
		int numDigitsOfM = 0;
		
		for (int i = 0; i < n.length(); ++i) {
			char curChar = n.charAt(i);
			if (curChar != '0') {
				foundFirstNonZero = true;
			}
			if (foundFirstNonZero) {
				++numDigitsOfN;
			}
		}

		foundFirstNonZero = false;
		for (int i = 0; i < m.length(); ++i) {
			char curChar = m.charAt(i);
			if (curChar != '0') {
				foundFirstNonZero = true;
			}
			if (foundFirstNonZero) {
				++numDigitsOfM;
			}
		}
		
		return numDigitsOfM == numDigitsOfN;
	}
}
