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();
	}

}

/**
 *
 * @author Prasun
 */
import java.io.*;
public class C2012 {
    public static void main(String prsn[]) throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int T,A,B, i,j, cnt=0,div, m, qsn, rem, CNo=1, n;
        T=Integer.parseInt(br.readLine());
        String[] line=null;
        //System.out.println(" " + Mul(T,1000));
        while(T>0)
        {
            line=br.readLine().split(" ");
            A=Integer.parseInt(line[0]);
            B=Integer.parseInt(line[1]);
            cnt=0;
            OUTER:
            for(i=A;i<B;i++)
            {
                for(j=i+1;j<=B;j++)
                {
                    n=length(i);
                    if(n<length(j))
                    {
                        continue OUTER;
                    }


                    div=(int)Math.pow(10,n-1);
                    m=i;
                    do
                    {
                        qsn=m/div;
                        rem=m%div;
                        if(rem==0)break;
                        m=(rem*10 + qsn); if(Mul(rem,div)>0) m=m* 10 * Mul(rem,div);
                        if(m==j)
                        {
                            cnt++;
                            //System.out.println( i + " : " + j + " == " + m);
                            break;
                        }
                        n--;
                    }while(n>0);
                }
            }
            System.out.println("Case #" + CNo + ": " + cnt);
            CNo++;
            T--;
        }
    }
    public static int length(int x)
    {
        int l=0;
        while(x>0)
        {
            x=x/10;
            l++;
        }
        return l;
    }
    public static int Mul(int x, int div)
    {
        int cnt=-1;
        while(div!=0 && (x/div) <= 0)
        {
            cnt++;
            div=div/10;
        }
        return cnt;
    }
}
