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();
	}

}

package codejam.qualification;

import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		String file = "input3big";
		Scanner in = new Scanner(new File(file));
		int tot = Integer.parseInt(in.nextLine());
//		System.out.println(tot);
		for(int i=0;i<tot;i++) {
			String line = in.nextLine();
			String[] data = line.split(" ");
			int A = Integer.parseInt(data[0]);
			int B = Integer.parseInt(data[1]);
			
			int output = 0;
			for(int j=A; j<=B; j++) {
//				System.out.println("("+j+")");
				String s = j+"";
				output += countRecycled(s, B);
			}
			
			System.out.println("Case #"+(i+1)+": "+output);			
		}

}

	private static int countRecycled(String s, int B) {
		ArrayList<String> rec = new ArrayList<String>();
		int count = 0;
		
		for(int i=s.length()-1; i>0; i--) {
			String r = s.substring(i) + s.substring(0, i);
//			System.out.println(r);
			int s_int = Integer.parseInt(s);
			int r_int = Integer.parseInt(r);
			if(r.charAt(0) != 0 && s_int < r_int && r_int <= B && !isIn(r,rec)) {
//				System.out.println("ok: "+s+"\t"+r);
				count++;
				rec.add(r);
			}
		}

		return count;
	}

	private static boolean isIn(String r, ArrayList<String> rec) {
		for(String r2 : rec)
			if(r.equals(r2))
				return true;
		return false;
	}
}