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

public class RecycledNumbers {
	public static void main(String... args) throws Exception {

		BufferedReader br = new BufferedReader(
		new FileReader(System.getProperty("user.home") + "/Desktop/csmall.in")
		//new InputStreamReader(System.in)
		);

		int times = Integer.parseInt(br.readLine());

		for (int i = 0; i < times; i++) {
			numbers(br.readLine(), i+1);
		}

	}

	public static void numbers(String data, int num) {
		int a = Integer.parseInt(data.split(" ")[0]);
		int b = Integer.parseInt(data.split(" ")[1]);
		int count = 0;
		
		for (int n = a; n < b; n++) {
			String nn = n+"";
			for (int m = n+1; m <= b; m++) {
				String mm = m+"";
				if (nn.length() != mm.length()) {continue;}
				
				boolean check = false;
				for (int i = mm.length() - 1; i >= 0; i--) {
					String news = mm.substring(i);
					String newst = news + mm.substring(0, i);
					check = check(nn, newst);
					if (check) {
						count++;
						break;
					}
				}
				
			}
		}
		
		System.out.println("Case #" + num + ": " + count);
	}
	
	public static boolean check(String a, String b) {
		a = Integer.parseInt(a) + "";
		b = Integer.parseInt(b) + "";
		
		if (a.equals(b) || a.length() != b.length()) {
			return false;
		}
		
		String end = "";
		
		for (int i = b.length(); i >= 0; i--) {
			String first = b.substring(i);
			end = first + b.substring(0, i);
			
			if (a.equals(end)) {
				return true;
			}
		}
		
		return false;
	}
}
