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.FileReader;
import java.util.ArrayList;

public class Run3
{
	private static class Pair
	{
		private String n;
		private String m;
		
		public Pair(String n, String m)
		{
			this.n = n;
			this.m = m;
		}
		
		public String getStringN()
		{
			return n;
		}
		
		public String getStringM()
		{
			return m;
		}
		
		public int getIntegerN()
		{
			return Integer.parseInt(n);
		}
		
		public int getIntegerM()
		{
			return Integer.parseInt(m);
		}
		
		@Override
		public boolean equals(Object obj)
		{
			Pair pair = (Pair)obj;
			if ((pair.getStringN().equals(this.n) && pair.getStringM().equals(this.m)) ||
				(pair.getStringN().equals(this.m) && pair.getStringM().equals(this.n)))
			{
				return true;
			}
			else
			{
				return false;
			}
		}
		
		@Override
		public String toString()
		{
			return n+" "+m;
		}
	}
	public static void main(String[] args)
	{
		String path = "files/C-small-attempt1.in";
		
		int T = 0;
		ArrayList<Integer> A = new ArrayList<Integer>();
		ArrayList<Integer> B = new ArrayList<Integer>();
		
		ArrayList<Pair> pairs = new ArrayList<Pair>();
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					A.add(Integer.parseInt(temp[0]));
					B.add(Integer.parseInt(temp[1]));
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for (int i = 0; i < T; i++)
		{
			pairs.clear();
			int start = A.get(i);
			int end = B.get(i);
			
			for (int j = start; j <= end; j++)
			{
				String n = String.valueOf(j);
				String m = "";
				for (int x = 1; x < n.length() ; x++)
				{
					m = moveDigital(n, x);
					if (start <= Integer.parseInt(n) && Integer.parseInt(n) < Integer.parseInt(m) && Integer.parseInt(m) <= end)
					{
						Pair pair = new Pair(n, m);
						if (!pairs.contains(pair))
						{
							pairs.add(pair);
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+pairs.size());
		}
	}
	
	static public String moveDigital(String number, int digitals)
	{
		return number.substring(number.length()-digitals, number.length())+number.substring(0, number.length()-digitals);
	}
}