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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.Vector;

public class C {
	
	public static void main(String[] args) {
		
		Vector<Integer> num = new Vector<Integer>();
		Vector<Integer> counts = new Vector<Integer>();
		int count = 0;
		int cases = 0;
		int n = 0;
		boolean seen = false;
		int start, end;
		String num1, num3 = null;
		char num2[];
		
		try {
			Scanner in = new Scanner(new FileReader("C-small-attempt0.in"));
			
			cases = in.nextInt();
			
			for (int i = 0; i < cases; i++) {
				
				count = 0;
				start = in.nextInt();
				end = in.nextInt();
				num1 = Integer.toString(start);
				
				for (int j = start; j < end; j++) {
					num1 = Integer.toString(j);
					if (num.contains(j) == false) {
						num.add(Integer.parseInt(num1));
						num2 = num1.toCharArray();
						//System.out.print(num1);
						n = 0;
						for (int k = 0; k < num2.length - 1; k++) {
							seen = false;
							char temp = num2[num2.length - 1];
							for (int l = num2.length - 1; l >= 1; l--) {
								num2[l] = num2[l - 1];
							}
							num2[0] = temp;
							num3 = new String(num2);
							//System.out.println("2 " + num3);
							seen = num.contains(Integer.parseInt(num3));
							if (seen == false && num2[0] != '0' && 
									Integer.parseInt(num3) <= end &&
									Integer.parseInt(num3) >= start &&
									num3.equals(num1) == false) {
								//System.out.println("Original " + num1);
								//System.out.print(", " + num3);
								num.add(Integer.parseInt(num3));
								n++;
								//System.out.println("n: " + n);
							}
						}
						//System.out.println();
						count += (n * (n + 1) / 2);
					}
				}
				num = new Vector<Integer>();
				counts.add(count);
				System.out.println(count);
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		try {
			FileWriter out = new FileWriter("C.out");
			BufferedWriter writer = new BufferedWriter(out);
			
			for (int i = 0; i < cases; i++) {
				writer.write(String.format("Case #%d: %d\n", i + 1, counts.get(i)));
			}
			
			writer.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
