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;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.Vector;


public class RecycledNumbers {


	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		String strNumberOfSentences = "";
		InputStreamReader converter = new InputStreamReader(System.in);
		BufferedReader in = new BufferedReader(converter);
		    
		Integer numberOfSentences = -1;
		MyPair[] sentences = null;
		try {
			strNumberOfSentences = in.readLine();
		
			numberOfSentences = Integer.parseInt(strNumberOfSentences);
			sentences = new MyPair[numberOfSentences];
			
			for ( int i = 0; i < numberOfSentences; ++i) {
				sentences[i] = new MyPair(in.readLine());
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		if ( numberOfSentences == -1) {
			return;
		}
		
		Vector<MyPair> usedNumbers = new Vector<MyPair>();
		
		for ( int i = 0; i < numberOfSentences; ++i) {
			
			int curr = sentences[i].lowerLimit;
			while (curr < sentences[i].higherLimit) {
				StringBuilder sss = new StringBuilder("");
				
				sss.append(String.valueOf(curr));
				StringBuilder sss2 = new StringBuilder(String.valueOf(curr));
				for (int ii = 0; ii < sss.length()-1; ++ii) {
					
					char temp = sss2.charAt(0);
					sss2.replace(0, 0, String.valueOf(sss2.charAt(sss2.length()-1)));
					sss2.delete(sss2.length()-1, sss2.length());
					
					if (Integer.parseInt(sss2.toString()) <= sentences[i].higherLimit && 
						Integer.parseInt(sss2.toString()) >= sentences[i].lowerLimit &&
						
						Integer.parseInt(sss.toString()) < Integer.parseInt(sss2.toString()) ) {
						MyPair x = new MyPair(Integer.parseInt(sss.toString()),Integer.parseInt(sss2.toString()));
						boolean isFound = false;
						for (int kkk =0; kkk < usedNumbers.size(); ++kkk ){
							if ( usedNumbers.get(kkk).sameAs(x) ) {
								isFound = true;
							}
						}
						if ( !isFound ) {
							usedNumbers.add(x);
							//System.out.println("" + curr + ": " + x.lowerLimit + "," + x.higherLimit );
						}
					}
				}
				curr++;
			}
			
			System.out.println("Case #" + new Integer(i+1).toString() + ": " + usedNumbers.size() );
			SortedSet<Integer> usedNumbers2 = new TreeSet<Integer>();
			for (int kkk =0; kkk < usedNumbers.size(); ++kkk ){
				if ( !usedNumbers2.contains(usedNumbers.get(kkk).lowerLimit) ) {
					usedNumbers2.add(usedNumbers.get(kkk).lowerLimit);	
				}
				if ( !usedNumbers2.contains(usedNumbers.get(kkk).higherLimit) ) {
					usedNumbers2.add(usedNumbers.get(kkk).higherLimit);	
				}
			}
			for (Integer item: usedNumbers2 ){
				//System.out.println("" + item.toString() );	
			}
			
			usedNumbers.clear();
			
			
		}
		
		

	}

}



/*			
			int length = sentences[i].lowerLimit.length();
			
			if ( length == 0 || length == 1) {
				numberOfShits = 0;
			}
			else if ( length == 2) {
				int iii = 
						Character.digit(sentences[i].higherLimit.charAt(0),10) - 
						Character.digit(sentences[i].lowerLimit.charAt(0),10);
				
				numberOfShits *= iii * 2;
			}
			else if ( length > 2) {
				numberOfShits = (int) Math.pow(10, length-2);
				int iii = 
						Character.digit(sentences[i].higherLimit.charAt(0),10) - 
						Character.digit(sentences[i].lowerLimit.charAt(0),10);
				
				numberOfShits *= iii * iii;
				numberOfShits -= iii;
			}
			
			
			*/