/*
 * 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.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers 
{
	static HashSet<String> set;
	public static int solve(int A, int B)
	{
		int count = 0;
		for(int n = A; n < B;n++)
		{
			String temp = n+"";
			int len = temp.length();
			for(int j = 0;j < len-1;j++)
			{
				temp = temp.charAt(len-1)+temp.substring(0,len-1);
				
				int m = Integer.parseInt(temp);
				if(set.contains(""+m))
					continue;
				if(m > n && m <= B)
					count++;
					
				set.add(""+m);
			}
			set.clear();
			
		}
		return count;
	}
	public static void main(String[] args) 
	{
		set = new HashSet<String>();
		Scanner sc = null;
		try {
			sc = new Scanner(new File("C:\\Users\\oibe\\Desktop\\C-small-attempt1.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int numCases = Integer.parseInt(sc.nextLine());
		for(int i = 1; i <= numCases;i++)
		{
			String[] vals = sc.nextLine().split(" ");
			int A = Integer.parseInt(vals[0]);
			int B = Integer.parseInt(vals[1]);
			System.out.println("Case #"+i+": "+solve(A,B));
		}
	}

}
