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.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumber {
	
//	static HashMap<Integer, ArrayList<Integer>> cache;

	public static void main(String[] args) throws IOException{
		
		String path = "C:\\Users\\Rapol Tongchenchitt\\Documents\\CodeJam\\";
		String year = "Qual2012\\";
		
		String test = "input.txt"; String outPath = "output.txt";
		String a = ""; String A = "";
		String b = ""; String B = "";
		String c = "C-large.in"; String C = "C-large.out";
		String d = ""; String D = "";
		
		String inName = path+year+c;
		String outName = path+year+C;
		
		Scanner in = new Scanner(new FileInputStream(inName));
		BufferedWriter out = new BufferedWriter(new FileWriter(outName));
		
		int caseCount = in.nextInt(); int currentCase = 0;
		
		while(currentCase++ < caseCount){
			
			int minNum = in.nextInt();
			int maxNum = in.nextInt();
			int ans = 0;
			
			for( int i = minNum; i <= maxNum; i++){
				ans += perform(i, minNum, maxNum);
			}
			
			out.write("Case #" + currentCase + ": " + ans);
			out.newLine();
		}
		
		out.close();
		
	}

	private static int perform(int in, int left, int right) throws IOException{
		if(in < 10){
			return 0;
		}
		
		HashSet<Integer> set = new HashSet<Integer>();
		int ans = 0;
		String now = in + "";
		for(int i = 1; i < now.length(); i++){
			if(now.charAt(i) >= now.charAt(0)){
				int shift = Integer.parseInt(now.substring(i) + now.substring(0,i));
				if(shift > in &&  shift <= right && shift >= left && !set.contains(shift)){
					ans++;
					set.add(shift);
				}
				
			}
		}
		
		return ans;
	}

}
