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


public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		int NumOfRecPairFound = 0;
		
		
		
        File file = new File("data/C-large.in");
        
        
        try {
            
        	Scanner scanner = new Scanner(file);
            
        	int numOfLines = scanner.nextInt();

        	scanner.nextLine();


        	
        	for (int i = 0; i < numOfLines; i++) {
        	
        		// Start from B down to A
        		// Ass is n is strictly less then m
        		int A = scanner.nextInt();
        		int B = scanner.nextInt();
        		
        		NumOfRecPairFound = 0;

        		// Special case
        		if (A < 10 || B < 10) {
        			System.out.println("Case #" + (i+1) + ": 0");
        			continue;
        		}
        		
        		int rotNumbers[];
        		
        		for (int m = B; m >= A; m--) {
        		
        			// Get all the rotated numbers first, then compare
        			rotNumbers = rotatedNumbers(m);
        			
        			for (int test : rotNumbers) {
        				if (test >= A && test < m) {
        					NumOfRecPairFound++;
        				}
        			}
        		}
        		
        			        		
        		System.out.println("Case #" + (i+1) + ": " + NumOfRecPairFound);
        		
        	}
        	
        	
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }

		
		
	}
	
	public static int[] rotatedNumbers(int number) {
		
		int orgNumber = number;
		
		// If we have a 4 digit number, there are 3 rotations (excluding itself)
		int NumOfRotations = (int)Math.log10(orgNumber);
		int output[] = new int[NumOfRotations];
        int mul = (int) Math.pow(10.0, (double)NumOfRotations);
        

       int i = 0;
        while(true)
        {
              int q = number / 10;
              int r = number % 10;

              number = number / 10;
              number = number + mul * r;

             
              if(number == orgNumber)
                    break;

              output[i++] = number;
        }
        
		
		return output;
	}

}
