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.util.HashSet;
import java.util.Scanner;
import java.util.regex.Pattern;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author alvin
 */
public class RecycledNumbers {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int nTC = sc.nextInt();
        for (int tc = 1; tc <= nTC; tc++) {
            int hasil = 0;
            
            int a = sc.nextInt(), b = sc.nextInt();
            
            String batas = Integer.toString(b);
            char maks = batas.charAt(0);
            
            int panjang = batas.length();
            
            for (int n = a; n < b; n++) {
                String s = Integer.toString(n);
                
                if (s.length() == 1) {
                    // System.out.println(s);
                    continue;
                }
                
                if (Pattern.compile("^(.)\\1*$").matcher(s).matches()) {
                    // System.out.println(s);
                    continue;
                }
                
                HashSet<String> sudah = new HashSet<String>();
                for (int i = s.length() - 1; i >= 1; i--) {
                    char c = s.charAt(i);
                    if (c == '0') {
                        continue;
                    }
                    
                    if (c < s.charAt(0)) {
                        continue;
                    }
                    
                    if (c > maks) {
                        continue;
                    }
                    
                    StringBuilder sb = new StringBuilder(panjang);
                    String cek = sb.append(s.substring(i)).append(s.substring(0, i)).toString();
                    
                    if ((cek.compareTo(s) > 0) && (cek.compareTo(batas) <= 0)) {
                        sudah.add(cek);
                    }
                }
                
                hasil += sudah.size();
            }
            
            System.out.format("Case #%d: %d\n", tc, hasil);
        }
    }
    
}
