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      :Yasith Maduranga(Merlin)
 * @version     :1.0
 * @Date        :2012/4/14
 * @Copyright GSharp Lab, All Rights Reserved....
 */
import java.io.*;
import java.util.*;

class recyclednumbers {
	public static void main(String args[]){
		try{
	    	BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
	    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C-small-attempt0.out")));

	    	int noOfCases = Integer.parseInt(br.readLine());

	    	for(int i=0;i<noOfCases;i++){
	    		String tmp[]=br.readLine().split(" ");
	    		long a=Long.parseLong(tmp[0]);
	    		long b=Long.parseLong(tmp[1]);
	    		long pairOfNo=0;
	    		ArrayList<Long> myArray=new ArrayList<Long>();
	    		myArray.add(a);

	    		for(long j=a;j<b+1;j++){
					long charLength=String.valueOf(j).length();
					if(charLength<=1){
						break;
					}
					for(long k=0;k<charLength-1;k++){
						String tmp1=String.valueOf(j).substring(0,(int)k+1);
						String tmp2=String.valueOf(j).substring((int)k+1);
						String newNo=tmp2+tmp1;
						if(Long.parseLong(newNo)<=b){
							if(!(Long.parseLong(newNo)==j)){
								if(!(Long.parseLong(newNo)<=j)){
									boolean isRepeated=true;
									for(long l=0;l<myArray.size();l++){
										if(myArray.get((int)l)==Long.parseLong(newNo)){
											isRepeated=true;
										}else{
											isRepeated=false;
										}
									}
									if(!isRepeated){
										pairOfNo++;
										myArray.add(Long.parseLong(newNo));
									}

								}
							}
						}
					}
	    		}
				out.println("Case #"+(i+1)+": "+pairOfNo);
	    	}



	    	out.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	    	System.exit(0);
	}
}
