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 third;

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

/**
 *
 * @author Yogendra
 */
public class Third {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        
        File f = new File("input.txt");
        Scanner s = new Scanner(f);
       
        int [] check;
        int answer=0;
        int total=s.nextInt();
        for(int i=0;i<total;i++)
        {
            int first = s.nextInt();
            int last = s.nextInt();
            
                for(int j=first;j<=last;j++)
                {
                    int f1=0;
                    if(first>99 && last<=999)
                    {
                        check = new int [1000];
                        int temp1,temp2,temp21,temp3;
                        f1=1;
                        temp21=j/10;
                        temp2=temp21%10;
                        temp3=j%10;
                        temp1=temp21/10;
                        for(int l=0;l<=999;l++)
                        {
                            check[l]=0;
                        }
                        if(temp3>=temp1)
                        {
                            int tempnum=(temp3*100)+(temp1*10)+temp2;
                            if((tempnum <=last)&&(tempnum>j) && check[tempnum]!=1)
                            {
                                check[tempnum]=1;
                                answer++;
                            }
                        }
                         if(temp2>=temp1 )
                        {
                            int tempnum=(temp2*100)+(temp3*10)+temp1;
                            if((tempnum<=last)&&(tempnum > j) && check[tempnum]!=1 )
                            {
                                check[tempnum]=1;
                                answer++;
                            }
                        }
                    }
                    else if((first > 9 && last<=99))
                    {
                        check = new int [99];
                        for(int k=0;k<99;k++)
                        {
                            check[k]=0;
                        }
                        int temp1,temp2;
                        temp1= j/10;
                        temp2=j%10;
                        if(temp2>temp1)
                        {
                            int tempnum=(temp2*10)+temp1;
                            if((tempnum<=last)&&(check[tempnum]!=1))
                            {
                                answer++;
                                check[tempnum]=1;
                            }
                        }
                    }
                }
                 System.out.println("Case #"+(i+1)+": "+answer);
                 answer=0;
        }
    }
}
