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.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;


public class Rec {

	static Writer out;
	static Scanner sc;
	public static void main(String[] args) throws IOException {
		sc=new Scanner(new File("input.txt"));
		out = new OutputStreamWriter(new FileOutputStream("out.txt"));
		int num_of_cases=sc.nextInt();
		int a,b;
		
		for (int i = 1; i <= num_of_cases; i++) {
			a=sc.nextInt();
			b=sc.nextInt();
			solve(a,b,i);
		}
		//System.out.println("Done");
		out.close();
	}
	private static void solve(int a, int b, int case_num) throws IOException {
		int len=String.valueOf(a).length();
		int count=0;
		int t;
		boolean [][]arr=new boolean[b+1][b+1];
		for(int i=0;i<b+1;i++){
			for (int j = 0; j < b+1; j++) {
				arr[i][j]=false;
			}
		}
		for(int k=a;k<b;k++){
			
			for (int i = 1; i <len ; i++) {			
				t=(int) (k/Math.pow(10, i) + k%Math.pow(10,i) * Math.pow(10,len-i) );
				if(t>a && t<=b && k<t){
					
					if(arr[k][t]==true){
						//System.out.println("***************************************************************************");
						count--;
					}
					arr[k][t]=true;
					count++;
					//System.out.println(a+", "+k+", "+t+", "+b);
				}
			}

		}
		//System.out.println("Case #"+case_num+": "+count);
		out.append("Case #"+case_num+": "+count+'\n');
	}
	
	

}
