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.io.*;
import java.util.*;

public class C
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int numCases = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < numCases; i++) {
			solveCase(i+1, br.readLine());
		}
	}
	
	private static void solveCase(int caseNum, String line) {
		String[] parts = line.split(" ");
	
		int start = Integer.parseInt(parts[0]);
		int end = Integer.parseInt(parts[1]);
		
		System.out.println("Case #"+caseNum+": "+solve(start, end));
	}
	
	private static int solve(int start, int end) {
		
		int res = 0;
		for(int i = start; i <= end; i++) {
			HashSet<Integer> encountered = new HashSet<Integer>();
			
			String asString = ""+i;
			for(int index = 1; index < asString.length(); index++) {
				char letter = asString.charAt(index);
				if(letter == '0') {
					//System.out.println(i+": skip index "+index);
					continue; // cant have leading 0
				}
				int switched = Integer.parseInt(asString.substring(index)+asString.substring(0, index));
				if(switched > i && switched >= start && switched <= end) {
					//encountered.add(i);
					
					if(encountered.contains(switched)){
						//System.out.println("already had "+switched);
						continue;
					}
					encountered.add(switched);
					res++;
					//System.out.println(i+": "+switched);
				} else {
					//System.out.println(i+": "+switched+" doesnt work");
				}
			}
		}
		return res;
	}
}