/*
 * 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.io.FileNotFoundException;
import java.io.FileReader;


public class CodeJam
{
	public static void main(String[] args) throws Exception
	{
		File input=new File("input.txt");
		BufferedReader bufferedReader=new BufferedReader(new FileReader(input));
		String output="";
		String line=null;
		int lineCount=0;
		
		int caseNumbers=0;
		String solutionString="";
		while((line=bufferedReader.readLine())!=null)
		{
			if(lineCount==0)
			{
				caseNumbers=Integer.parseInt(line);
			}
			else
			{
				int solution=0;
				String[] split=line.split(" ");
				int a=Integer.parseInt(split[0]);
				int b=Integer.parseInt(split[1]);
				int n=a;
				int m=b;
				while(n<m)
				{
					while(n<m)
					{
						if(workout(n, m))
						{
							solution++;
						}
						n++;
					}
					n=a;
					m--;
				}
				solutionString=solutionString+"Case #"+Integer.toString(lineCount)+": "+Integer.toString(solution)+"\n";
			}
			lineCount++;
		}
		System.out.print(solutionString);
	}
	
	public static boolean workout(int n,int m)
	{
		boolean solution=false;
		String t=Integer.toString(n);
		char[] test=t.toCharArray();
		int count=1;
		while(count<=test.length)
		{
			String testString=new String(test);
			
			if(testString.equals(Integer.toString(m)))
			{
				solution=true;
			}
			char x=test[test.length-1];
			int count2=test.length-2;
			while(count2>=0)
			{
				test[count2+1]=test[count2];
				count2--;
			}
			test[0]=x;
			count++;
		}
		return solution;
	}

}
