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.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;

public class C
{
    Scanner in;
    PrintWriter out;
    PrintStream err;
    
    private boolean recycled(int x, int y) {
    	String s1 = Integer.toString(x);
    	String s2 = Integer.toString(y);
    	if (s1.length() != s2.length())
    		return false;
    	for (int i = 0; i < s1.length(); ++i)
    		if (s1.equals(s2.substring(i) + s2.substring(0, i)))
    			return true;
    	return false;
    }
 
    private void run() throws Exception
    {
    	//in  = new Scanner(System.in);
    	//out = new PrintWriter(System.out);
        //in = new Scanner(new FileInputStream(		new File("input")));
        in = new Scanner(new FileInputStream(		new File("C-small-attempt0.in")));
        //in = new Scanner(new FileInputStream(		new File("X-large.in")));
        out = new PrintWriter(new FileOutputStream(	new File("output")));
        err = System.out;

        int testCases = in.nextInt();

        for (int test = 1; test <= testCases; ++test) {
        	int a = in.nextInt();
        	int b = in.nextInt();
        	int result = 0;
        	for (int i = a; i <= b; ++i)
        		for (int j = i+1; j <= b; ++j)
        			if (recycled(i, j))
        				result++;
        	out.println("Case #" + test + ": " + result);
        }
        out.close();
    }

    public static void main(String[] args) throws Exception
    {
        new C().run();
    }
}