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 inam.qual;

import java.io.File;
import java.io.FileInputStream;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
    public void go() {
        Scanner in = new Scanner(System.in);
        int cc = in.nextInt();
        for (int c = 1; c <= cc; c++) {
            int val = 0;
            int a = in.nextInt();
            int b = in.nextInt();
            Set<String> set = new HashSet<String>();
            for (int i = a; i <= b; i++) {
                String str = String.valueOf(i);
                for (int j = 1; j < str.length(); j++) {
                    String re = str.substring(j, str.length()) + str.substring(0, j);
                    if (str.equals(re) || re.startsWith("0") || Integer.parseInt(re) > b || a > Integer.parseInt(re)) {
                        continue;
                    }
                    String key = "";
                    if (Integer.parseInt(str) < Integer.parseInt(re)) {
                        key = str + " " + re;
                    } else {
                        key = re + " " + str;
                    }
                    set.add(key);
                }
            }
            val = set.size();
            System.out.println("Case #" + c + ": " + val);
        }
    }
    public static void main(String[] args) {
        try {
            String p = "C-large";
            String r = "qual";
            System.setIn(new FileInputStream(new File(r, p + ".in")));
            if (1 == 1) {
                System.setOut(new PrintStream(new File(r, p + ".out")));
            }
            new C().go();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}
