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.FileWriter;
import java.io.IOException;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author utp
 */
public class C {
    public static void main(String Args[]) throws IOException{
        Scanner sc = new Scanner (new File("input.in"));
        FileWriter fw = new FileWriter("output.out");
        int T = sc.nextInt();
        for (int k=0;k<T;k++){
            int A=sc.nextInt();
            int B = sc.nextInt();
            int count=0;
        for (int i=A;i<=B;i++){
            for (int j=i+1;j<=B;j++){
            String num1 = Integer.toString(i);
            String num2 = Integer.toString(j);
            if (j==1121){
              //  System.out.println("");
            }
             int c = calcular(num1.toCharArray(),num2.toCharArray());
             if (c>=0){
                 String sub2 = num2.substring(0, c);
                 String sub1 = num2.substring(c);
                 if (num1.equals(sub1.concat(sub2))){
                  //   System.out.println("Case #"+(k+1)+": "+sub1+" "+sub2+" "+num1+" "+num2);
                     count++;
                 }
             }
            }
            }
        fw.write("Case #"+(k+1)+": "+count+"\n");
        }
        fw.close();
    }
    
    public static int calcular(char cad1[], char cad2[]){
        for (int j=0;j<=cad1.length;j++){
            String temp1 = String.copyValueOf(cad1, j,cad1.length-j);
            String tmp2 = String.copyValueOf(cad2);
            if (tmp2.contains(temp1)){
                return temp1.length();
            }
            
        }
        return -1;
    }
}
