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.ArrayList;
import java.util.Enumeration;
import java.util.Scanner;


public class E3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub


		Scanner sc = null;
		
		sc = new Scanner(System.in);
		
		/*try {
			sc = new Scanner(new File("E3.txt"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}*/
		
		
		int fases = sc.nextInt();
		
		
		for(int j=1; j<=fases; ++j){
			
			int n1 = sc.nextInt();
			int n2 = sc.nextInt();
			int casos = 0;
			
			for(int k=n1; k<=n2; ++k){
				String s = k + "";
				
				int l = s.length();
				
				ArrayList<Integer> arr = new ArrayList<Integer>();
				
				for(int i=1; i<l; ++i){
					String s2 = s.substring(i) + s.substring(0, i);
					
					if(s2.startsWith("0"))
						continue;
					
					int ns = Integer.parseInt(s2);
					
					if(ns >= n1 && ns <= n2 && ns != k && !arr.contains(ns)){
						
						casos++;
						arr.add(ns);
						//System.out.println(ns);
					}
				}
				
			}
			
			System.out.println("Case #" + j + ": " + casos / 2);
		}
		
		
	}

}
