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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class SmallMain 
{
	public static void main( String arg[] )
		throws IOException
	{
		BufferedReader reader = new BufferedReader( new InputStreamReader( System.in ) );
		String line = null;
		int test = 0;
		int testCases = 0;
		while( ( line = reader.readLine() ) != null && test <= testCases )
		{
			if( line != null && !line.isEmpty() )
			{
				String tokens[] = line.split( " " );
				if( tokens.length == 1 && testCases == 0 )
				{
					testCases = Integer.parseInt( tokens[ 0 ] );
				}
				else if( tokens.length == 2 )
				{
					++test;
					int start = Integer.parseInt( tokens[ 0 ] );
					int end = Integer.parseInt( tokens[ 1 ] );
					int counter = 0;
					for( int i = start; i <= end; ++i )
					{
						for( int j = start; j <= end; ++j )
						{
							if( i < j )
							{
								for( int s = 1; s < ( "" + j ).length(); ++s )
								{
									if( i == moveDigits( j, s ) )
									{
										++counter;
										break;
									}
								}
							}
						}
					}
					System.out.println( "Case #" + ( test ) + ":  "+ counter );
				}
				else
				{
					System.out.println( "Invalid length: " + tokens.length + " line: " + line );
				}
			}
		}
		reader.close();
	}
	
	private static int moveDigits( int number, int digits )
	{
		int r;
		String n = "" + number;
		String end = n.substring( n.length() - digits );
		String start = n.substring( 0, n.length() - digits );
	//	System.out.println( "N: " + number + " d: " + digits + " start: " + start + " end: " + end );
		r = Integer.parseInt( end + start );
		return r;
	}
}
