package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			BufferedReader bf=null;
			try {
				int T;
				bf = new BufferedReader(new FileReader("src/com/codejam/input/C-large.in"));
				T = Integer.parseInt(bf.readLine());
				for(int i=0;i<T;i++){
					String line = bf.readLine();
					String[] numbers = line.split(" ");
					int A = Integer.parseInt(numbers[0]);
					int B = Integer.parseInt(numbers[1]);
					int seq = A;
					int count=0;
					
					while(seq<B){
						count += checkRecycle(String.valueOf(seq), numbers[0], numbers[1]);
						seq++;
					}
					
					System.out.println("Case #"+(i+1)+": "+count);
					
				}
				
			} catch (FileNotFoundException e) {
				
				e.printStackTrace();
			} finally{
				bf.close();
			}
	
			
		}catch(IOException e){
			e.printStackTrace();
		}

	}
	
	public static int checkRecycle(String N,String min,String max){
	
		int mNum,nNum,maxNum;
		Set<String> uniqueNum = new HashSet<String>();
		
		for(int i=N.length()-1;i>0;i--){
			if( Character.getNumericValue(N.charAt(i)) > Character.getNumericValue(max.charAt(0)) ) continue;
			
			String M;
			M=N.substring(0, i);
			M=N.substring(i,N.length())+M;
		    mNum = Integer.parseInt(M);
			nNum = Integer.parseInt(N);
			maxNum = Integer.parseInt(max);
			if(mNum>nNum && mNum<=maxNum){
				uniqueNum.add(M);
			}
		}
		
		return uniqueNum.size();
	}

}
