import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

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

	/**
	 * @param args the command line arguments
	 */
	public static void main(String[] args) {
		(new RecycledNumbers()).findRecycledNumbers("C-large.in", "C-large.out", "\n");
	}
	
	private void findRecycledNumbers(String filename, String outputFile, String separator) {
		int numberOfTestCases = CodeJamFileManager.getIntFromFirstLineOfFile(filename, separator);
		String[] testCases = CodeJamFileManager.getTextLinesOfFile(filename, separator);
				String output = "";
		for (int i = 1; i <= numberOfTestCases; i++) {
			output += "Case #" + i + ": " + getNumberOfRecycledInts(testCases[i]) + (i != numberOfTestCases ? separator : "");
		}
		CodeJamFileManager.saveOutputFile(output, outputFile, separator);
	}
	
	private int getNumberOfRecycledInts(String testcase) {
		int[] params = getIntArrayFromString(testcase.split(" "));
		int lower = params[0];
		int upper = params[1];
		int currentM = lower + 1;
		int numberOfRecycles = 0;
		while (currentM <= upper) {
			int count = timesRecycled(lower, currentM++);
			numberOfRecycles += count;
		}
		return numberOfRecycles;
	}
	
	private int timesRecycled(int lower, int currentM) {
		String currentMStr = String.valueOf(currentM);
		char[] individualNumbers = currentMStr.toCharArray();
		int timesRecycled = 0;
		for (int i = 1; i < individualNumbers.length; i++) {
			int flip = flip(individualNumbers, i);
			if (flip >= lower && flip < currentM) {
				timesRecycled++;
			}
		}
		return timesRecycled;
	}
	
	private int flip(char[] individualNumbers, int positionsToFlip) {
		char[] flip = new char[individualNumbers.length];
		int startInt = individualNumbers.length - positionsToFlip;
		int flipPos = 0;
		while (startInt < individualNumbers.length) {
			flip[flipPos++] = individualNumbers[startInt++];
		}
		int i = 0;
		while (i < (individualNumbers.length - positionsToFlip)) {
			flip[flipPos++] = individualNumbers[i++];
		}
		return Integer.parseInt(String.valueOf(flip));
	}
	
	private int[] getIntArrayFromString(String[] intStrArray) {
		int[] intArray = new int[intStrArray.length];
		int i = 0;
		for (String intStr : intStrArray) {
			intArray[i++] = Integer.parseInt(intStr);
		}
		return intArray;
	}
}
