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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class Recycled {

		public static void main(String args[]) {
			try {
				File file = new File("input.txt");
				FileReader filereader = new FileReader(file);
				BufferedReader br = new BufferedReader(filereader);

				File out = new File("output.txt");
				FileWriter filewriter = new FileWriter(out);
				BufferedWriter bw = new BufferedWriter(filewriter);
				PrintWriter pw = new PrintWriter(bw);

				String str = br.readLine();
				int line = Integer.valueOf(str);
				for (int i = 0; i < line; i++) {
					int x = i + 1;
					pw.print("Case #" + x + ": ");
					str = br.readLine();
					int ans = solve(str);
					pw.println(ans);
				}
				pw.close();
				bw.close();

			} catch (IOException ie) {
				ie.printStackTrace();
			}
		}

		private static int solve(String s) {
			List<String> list = new ArrayList<String>();
			int count = 0;
			String[] elems = s.split(" ");
			int A = Integer.valueOf(elems[0]);
			int B = Integer.valueOf(elems[1]);
			for (int i = A; i <= B; i++) {
				String str = String.valueOf(i);
				if(str.length() <= 1) continue;
				for(int j = 0; j < str.length() - 1; j++) {
					String after = str.substring(0, j+1);
					String before = str.substring(j+1,str.length());
					String strRecycled = before + after;
					int recycled = Integer.valueOf(strRecycled);
					if(i<recycled && recycled<=B) {
						String q = String.valueOf(i)+String.valueOf(recycled);
					    if(!list.contains(q)) { list.add(q); count++; }
					}
				}

			}
			return count;

		}
}


