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

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

import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author rama
 */
public class Codejam1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=Integer.parseInt(in.nextLine());
        for(int i=1;i<=n;++i)
            System.out.println("Case #"+i+": "+trans(in.nextLine()));
    }
    
    public static int trans(String ss){
        int ans=0,p1,p2;
        StringTokenizer tok=new StringTokenizer(ss," ");
        int A=Integer.parseInt(tok.nextToken());
        int B=Integer.parseInt(tok.nextToken());
        int digit=dig(A);
        if(digit==1)
            return 0;
        
        for(int n=A;n<=B;++n){
            int arr[]={0,0,0,0,0,0,0,0,0};
           //System.out.println("*");
            boolean state=true;
            for(int j=1;j<=digit-1;++j){
                p1=(int)(n%Math.pow(10,j));
                //System.out.println("**"+p1);
                p2=(int)(n/Math.pow(10,j));
                //System.out.println("***"+p2);
                int m=p1*(int)(Math.pow(10,(digit-j)))+p2;
                
                if(m>n&&m<=B){
                    int k=0;
                    while(arr[k]!=0){
                        if(arr[k]==m){
                            state=false;
                        }
                        ++k;
                    }
                    if(state==true){
                    ++ans;
                    arr[k]=m;
                    }
                }
            }
        }
        return ans;
    }
    public static int dig(int num){
        if(num/10==0)
            return 1;
        else if(num/100==0)
            return 2;
        else if(num/1000==0)
            return 3;
        else if(num/10000==0)
            return 4;
        else if(num/100000==0)
            return 5;
        else if(num/1000000==0)
            return 6;
        else if(num/10000000==0)
            return 7;
        else if(num/100000000==0)
            return 8;
        else
            return 9;
    }
       
}

