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


public class RecycledNumbers {
	
	public static void main(String[] args) {
		
		try {
		
//			int T = 4;
//			int[][] testcases = new int[T][];
//			testcases[0] = new int[]{1,9};
//			testcases[1] = new int[]{10,40};
//			testcases[2] = new int[]{100,500};
//			testcases[3] = new int[]{1111,2222};
			
			BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("C-small-attempt0.in")));
			
			String firstLine = reader.readLine();
			int T = Integer.valueOf(firstLine);
			int[][] testcases = new int[T][];
			
			for(int i = 0; i < T; i++) {
				String[] testcase = reader.readLine().split(" ");
				testcases[i] = new int[2];
				testcases[i][0] = Integer.valueOf(testcase[0]);
				testcases[i][1] = Integer.valueOf(testcase[1]);				
			}
			
			RecycledNumbers recylcing = new RecycledNumbers();
			
			for(int i = 0; i < T; i++) {
				System.out.printf("Case #%d: ",i+1,testcases[i]);
				int result = recylcing.count(testcases[i]);
				System.out.printf("%s\n", result);
			}
			
		}
		catch(Exception ex) {
			System.out.println("An error occured:\n");
			ex.printStackTrace();
		}
		
		
	}
	
	public int count(int[] input) {
		
		int A = input[0];
		int B = input[1];
		
		int hits = 0;
		
		for(int i = 0; i <= B - A; i++) {
			for(int j = 0; j <= B - A; j++) {
				
				int lessB = B - i;
				int moreA = A + j;
				
				if(lessB >= moreA) {
				
					int switchA = moreA;
					do {
						if(lessB == switchA && switchA > moreA) {
							hits++;
							break;
						}
						char[] chars = Integer.toString(switchA).toCharArray();
						chars = rotateCharacters(chars);
						switchA = Integer.valueOf(String.valueOf(chars));
					} while (moreA != switchA);
					
				}
				else {
					break;
				}
				
			}
		}
		
		return hits;
		
	}
	
	public char[] rotateCharacters(char[] chars) {
		if(chars.length > 1) {
			char charNext = chars[1];
			chars[1] = chars[0];
			for(int i = 1; i < chars.length - 1; i++) {
				char charNextNext = chars[i+1];
				chars[i+1] = charNext;
				charNext = charNextNext;
			}
			chars[0] = charNext;
			if(chars[0] == '0') {
				return rotateCharacters(chars);
			}
			else {
				return chars;
			}
		}
		else {
			return chars;
		}
	}

}
