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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.File;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.io.FileReader;
public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception  {
		BufferedReader reader = null;
		String fileName = "C-small-attempt2.in";
		String outputFileName=fileName.replace(".in", ".out");
		reader=new BufferedReader(new FileReader(fileName));
		File outFile=new File(outputFileName);
		outFile.createNewFile();
		int T = Integer.parseInt(reader.readLine());
		for (int i = 1; i <=T; i++) {
			StringTokenizer t=new StringTokenizer(reader.readLine()," ");
			int start=Integer.parseInt(t.nextToken());
			int end=Integer.parseInt(t.nextToken());
			int count=0;
			HashMap<String,String> map=new HashMap<String,String>();
			for(int j=start;j<end;j++){
				String s=j+"";
				for(int k=1;k<s.length();k++){
					String ss=s.substring(s.length()-k);
					String es=s.substring(0,s.length()-k);
					if(ss.startsWith("0"))continue;
					int num=Integer.parseInt(ss+""+es);
					if(num<=end && num>=start && num>j){
						String key=j+"_"+num;
						if(map.get(key)==null){
							map.put(key, key);
							count++;
						}
					}
				}
			}
			System.out.println("Case #"+i+": "+count);
		
		}

	}

}
