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();
	}

}
package org.tritree_tritree;

import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Date;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class ProblemCSmall {

	public static void main(String[] args) throws IOException {
		File source = new File("C-small-attempt0.in");
		Scanner scan = new Scanner(source);

		int t = scan.nextInt();
		scan.nextLine();
		List<String> resultList = new ArrayList<String>();
		for (int i = 1; i < t + 1; i++) {
			int n = scan.nextInt();
			int m = scan.nextInt();
			String result = "Case #" + i + ": " + resolve(n, m);
			resultList.add(result);
		}

		SimpleDateFormat dateFormat = new SimpleDateFormat("yyyy-MM-dd_hhmmss");
		File resultFile = new File("C-small-" + dateFormat.format(new Date()) + ".out");
		FileOutputStream fileOutputStream = new FileOutputStream(resultFile);

		for (String result: resultList) {
			result = result + "\n";
			fileOutputStream.write(result.getBytes());
		}
		fileOutputStream.flush();
		fileOutputStream.close();
	}

	private static int resolve(int n, int m) {
		int cnt = 0;
		Set<Integer> pool = new HashSet<Integer>();
		for (int i = n; i < m + 1; i++) {
			if (i < 10 || pool.contains(i)) {
				continue;
			}
			List<Integer> recycleNumbers = getRecycleNumbers(i);
			System.out.println("i=" + i + ",recycleNumbers=" + recycleNumbers);
			Collections.sort(recycleNumbers);
			for (Iterator<Integer> iterator = recycleNumbers.iterator(); iterator.hasNext();) {
				int value = (Integer) iterator.next();
				if (n <= value && value <= m) {
					// do nothing
				} else {
					iterator.remove();
				}
			}
			if (1 < recycleNumbers.size()) {
				pool.addAll(recycleNumbers);
				cnt = cnt + getCombination(recycleNumbers.size());
			}
		}
		return cnt;
	}

	private static int getCombination(int size) {
		int result = (size * (size - 1)) / 2;
		return result;
	}

	private static List<Integer> getRecycleNumbers(int intValue) {
		Set<Integer> set = new LinkedHashSet<Integer>();
		String str = String.valueOf(intValue);
		for (int i = 0; i < str.length(); i++) {
			String string = getStartIndexString(str, i);
			if (string.startsWith("0")) {
				continue;
			}
			set.add(Integer.valueOf(string));
		}
		return new ArrayList<Integer>(set);
	}

	private static String getStartIndexString(String str, int startIndex) {
		StringBuilder builder = new StringBuilder();
		for (int i = 0; i < str.length(); i++) {
//			System.out.print("start:" + (startIndex + i) % str.length());
//			System.out.println(",end:" + ((startIndex + i) % str.length() + 1));
			builder.append(str.substring((startIndex + i) % str.length(), (startIndex + i) % str.length() + 1));
		}
		return builder.toString();
	}

}
