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.
 */
package qualificationRound2012;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author AHMED
 */
public class RecycledNumbers {
    public static void main(String[] args)throws Exception{
        RecycledNumbers r = new RecycledNumbers();
        //System.out.println(isRecycledPair(12345 , 51234));
        //System.out.println("0123456".substring(2,6));
        //414144414
        //441414441        
    }
    
    public RecycledNumbers() throws Exception{
        Scanner sc = new Scanner(new File("C-small-attempt0.in"));
        PrintWriter pin = new PrintWriter(new File("C-small-attempt0.out"));
        int T = Integer.parseInt(sc.nextLine());
        int A,B;
        int counter = 0;
        int x = 0;
        for(int testCaseIndex = 1 ; testCaseIndex <=T ; testCaseIndex++){
            A = sc.nextInt();
            B = sc.nextInt();
            //System.out.println(A+" "+B);
            for(int n = A ; n <= B ;n++){
                for(int m = (n+1) ; m<=B ;m++){
                    //pin.print(n+" "+m);
                    if(isRecycledPair(n,m))counter++;  
                }
            }
            pin.print("Case #"+testCaseIndex+": "+counter);
            if(testCaseIndex!=T)pin.print("\n");
            counter = 0;
        }
        pin.close();
        sc.close();
    }
    
    private static boolean isRecycledPair(int n, int m){
        if(n<10 && m<10)return false;//all digits < 10 cannto be recycled.
        
        String nString = Integer.toString(n);
        String mString = Integer.toString(m);
        int length = nString.length();
        int starting_mIndex = 0;
        String temp;
        
        for(int index = 0 ; index < length ; index++){
            for(starting_mIndex = 0 ; starting_mIndex < length ; starting_mIndex++){
                temp = mString.substring(starting_mIndex);
                temp+=mString.substring(0, starting_mIndex);
                if(temp.equals(nString))return true;
            }
        }
        
        return false;
        /*
        String nString = Integer.toString(n);
        String mString = Integer.toString(m);
        int length = mString.length();
        int nStringIndex;
        int mStrinIndex = mString.indexOf(nString.charAt(0)+"");//starting index
        
        //System.out.println(mStrinIndex);
        
        if(mStrinIndex == -1)return false;
        
        for(nStringIndex = 0 ; nStringIndex < length ; nStringIndex++){
            if(nString.charAt(nStringIndex)!=mString.charAt(mStrinIndex))return false;
            mStrinIndex = (mStrinIndex+1)%length;
        }
        
        return true;*/
    }
}
