import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
import java.util.Scanner;
import java.util.ArrayList;

public class recycled {
	public static void main(String [] args){
		Scanner Keyboard = new Scanner(System.in);
		int first, second;
		int n, m;
		String current = null, temp;
		Character current2;
		int whitespace = 0;
		int testCase;
		int testLength;
		String nString, mString;
		int recycledNumber = 0;
		ArrayList<String> input = new ArrayList<String>();
		ArrayList<Integer> recycled = new ArrayList<Integer>();
		ArrayList<String> nArray = new ArrayList<String>();
		ArrayList<String> mArray = new ArrayList<String>();
		boolean multiple = false;

		testCase = Keyboard.nextInt();
		Keyboard.nextLine();

		for (int a = 0; a < testCase; a++){
			input.add(Keyboard.nextLine());
		}

		for (int a = 0; a < testCase; a++){
			for (int i = 0; i < input.get(a).length(); i++){
				if (input.get(a).charAt(i) == ' '){
					whitespace = input.get(a).indexOf(' ');
					break;
				}
				else{
					if (i == 0){
						current2 = input.get(a).charAt(i);
						current = current2.toString();
					}
					else{
						current2 = input.get(a).charAt(i);
						temp = current2.toString();
						current = current.concat(temp);
					}
				}
			}
			first = Integer.parseInt(current);
			for (int i = whitespace+1; i < input.get(a).length(); i++){
				if (i == whitespace+1){
					current2 = input.get(a).charAt(i);
					current = current2.toString();
				}
				else{
					current2 = input.get(a).charAt(i);
					temp = current2.toString();
					current = current.concat(temp);
				}
			}
			second = Integer.parseInt(current);

			for (int i = first; i <= second; i++){
				for (int j = first; j <= second; j++){
					n = i;
					m = j;

					if (m>=n)
						break;

					nString = Integer.toString(n);
					mString = Integer.toString(m);

					testLength = Integer.toString(m).length();

					for (int k = testLength; k > 0; k--){
						current = nString.substring(k-1, testLength).concat(nString.substring(0, k-1));
						if (current.equals(mString)){
							for (int l = 0; l < nArray.size(); l++){
								if (nString.equals(nArray.get(l)) && mString.equals(mArray.get(l)))
									multiple = true;
							}
							nArray.add(nString);
							mArray.add(mString);
							if (!multiple){
								recycledNumber++;
							}
							multiple = false;
						}
					}
				}
			}
			recycled.add(recycledNumber);
			recycledNumber = 0;
			nArray.clear();
			mArray.clear();
		}

		for (int i = 0; i < recycled.size(); i++){
			System.out.println("Case #" + (i+1) + ": " + recycled.get(i));
		}
	}
}
