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.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;


public class RecycledNumbers {
	
	public static void main(String[] args) {

		Scanner sc = null;
		try {
			sc = new Scanner(new File("./C-large.in"));
		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		int numTestCases = Integer.parseInt(sc.nextLine());
		String eachTest = "";
		StringBuilder result = new StringBuilder();
		
		for(int i = 0; i < numTestCases; ++i) {
			eachTest = sc.nextLine();
			result.append(String.format("Case #%s: ", i+1));
			result.append(compute(eachTest));
			result.append("\n");
		}
		
		try {
			FileWriter fileWriter = new FileWriter("./output");
			fileWriter.write(result.toString());
			fileWriter.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	
		return;
	}
	
	private static int compute(String input) {
		String[] pieces = input.split(" ");
		int A = Integer.parseInt(pieces[0]);
		int B = Integer.parseInt(pieces[1]);
		return compute(A, B);
	}
	
	public static int compute(int A, int B) {
		Set<String> set = new HashSet<String>();
		int digitLen = ("" + A).length();
		int m = 0;
		for(int n = A; n <= B; ++n) {
			for(int i = 1; i < digitLen; ++i) {
				m = shift(n, i);
				if(m > n && m <= B) {
					set.add(n + "-" + m);
				}
			}
		}
		
		return set.size();
	}
	
	static int shift(int n, int i) {
		String word = "" + n;
		int len = word.length();
		int shift = len - i - 1;
		if(len < 2) {
			return n;
		} else if(len == 2) {
			String a = new String(word.charAt(1) + "");
			String b = new String(word.charAt(0) + "");
			return Integer.parseInt( a + b);
		}
		return Integer.parseInt(word.substring(shift + 1) + word.substring(0, shift + 1));
	}
	

	
}
