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 QR2012;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

public class C
{
	private static class Pair
	{
		final int n;
		final int m;

		public Pair(int n, int m)
		{
			this.n = n;
			this.m = m;
		}

		@Override
		public int hashCode()
		{
			final int prime = 31;
			int result = 1;
			result = prime * result + m;
			result = prime * result + n;
			return result;
		}

		@Override
		public boolean equals(Object obj)
		{
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Pair other = (Pair) obj;
			if (m != other.m)
				return false;
			if (n != other.n)
				return false;
			return true;
		}

	}

	public static void main(String[] args) throws Exception
	{
		String test = "C-small-attempt0";
		BufferedReader in = new BufferedReader(new FileReader("QR2012/C/" + test + ".in"));
		PrintWriter out = new PrintWriter("QR2012/C/" + test + ".out." + System.currentTimeMillis());

		final int T = Integer.parseInt(in.readLine());

		for (int t = 1; t <= T; t++)
		{
			String[] nums = in.readLine().split("\\s");
			final int A = Integer.parseInt(nums[0]);
			final int B = Integer.parseInt(nums[1]);

			Set<Pair> pairs = new HashSet<Pair>();
			
			final int order = (int) Math.floor(Math.log10(A)) + 1;
			for (int n = A; n <= B; n++)
			{
				int m = n;
				for (int o = 0; o < order - 1; o++)
				{
					// rotate m one digit
					int tail = m % 10;
					m /= 10;
					m += tail * Math.pow(10, order - 1);
					if (m > n && m >= A && m <= B)
						pairs.add(new Pair(n, m));
				}
			}

			System.out.println("Case #" + t + ": " + pairs.size());
			out.println("Case #" + t + ": " + pairs.size());
		}
		out.close();
	}
}
