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

public class recyle {
  
  public static int solve(String s) {
    String[] input = s.split(" ");
    String a = input[0];
    String b = input[1];
    if (a.length() != b.length()) return 0;
    if (Integer.parseInt(b) <= 10) return 0;
    int rotats = a.length();
    int largest = Integer.parseInt(b);
    int count = 0; 
    
    HashSet<Integer> done = new HashSet<Integer>();
    for (int i = Integer.parseInt(a); i <= largest; i++) {
      for (int j = 1; j < rotats; j++) {
        String n = String.valueOf(i);
        String x = n.substring(0, rotats - j);
        String y = n.substring(rotats - j);
        if (y.charAt(0) == '0') continue; // No zero startings
        int nn = (int) (Integer.parseInt(y) * Math.pow(10, rotats - j) + Integer.parseInt(x));
        if (nn == i || i >= nn || nn > largest) continue;
        //sb.append(n); sb.append(String.valueOf(nn));
        int key = nn << 8 | i;
        if (!done.contains(key)) {
          done.add(key);
          count++; 
        }
      }
    }
    return count;
  }
  
  public static void main(String[] args) {
    Scanner scanner = null;
    try {
      //scanner = new Scanner(System.in);
      scanner = new Scanner(new File("A-small-attempt0.in"));
    }catch (Exception e){
      System.out.println(e.getMessage());
    }
    
    String c = scanner.nextLine();
    int i = 1;
    while (scanner.hasNextLine()) {
      String input = scanner.nextLine();
      System.out.println("Case #" + i + ": " + solve(input));
      i++;
    }
  }
}
