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.util.*;

public class RecycledNumbers{
	
	static HashSet<String> hs;
	public static int single(int n, int[] digits){
		int i = 0;
		while(n>0){
			digits[i] = n%10;
			n = n/10;
			i++;
		}
		return i;
	} 	
	
	public static int toNumber(int[] d){
		int n = 0;
		for(int i = d.length-1; i>=0; i--){
			n = (n*10)+d[i];
		}		
		return n;
	}
	
	public static int pairs(int nd, int[] d, int ja, int m){
		int total = 0;
		int last = nd -1;
	
		for(int ni = 0; ni<last; ni++){
			//System.out.println("Moving "+d[ni]);
			int[] arr = new int[nd];
			int pa  = 0;
			for(int i = ni+1; i< nd; i++){
				arr[pa] = d[i];
				pa++;
			}
			for(int i = 0; i<=ni; i++){
				arr[pa] = d[i];
				pa++;
			}
			//System.out.println("Array "+Arrays.toString(arr));
			int nn = toNumber(arr);
			//System.out.println("New number "+nn);
			if((nn>ja) && nn <= m){
				total++;
				hs.add(ja+","+nn);		
			}
			
		}
		
		return total;
	}

	public static int solve(int a, int b){
		String sa = a+"";
		String sb = b+"";
		hs =  new HashSet<String>();
		int la = sa.length();
		int lb = sb.length();
		if(la == 1)
			return 0;
		int[] digitsa  = new int[7];
		
		int[] digitsb  = new int[7];
		int ndigits = single(a, digitsa);
		single(b, digitsb);
		int  count  = 0;
		for(int ja =a; ja < b; ja++){
			int[] digitsja  = new int[7];
//			System.out.println("Checking "+ja);
			single(ja, digitsja);
			int npa = pairs(ndigits, digitsja, ja, b );
			
			count+=npa;	
			if(npa > 0){
	//			System.out.println("j "+ja+" npa "+npa);
			}
		}
		//System.out.println(count);
		return hs.size();
	}
	
	public static void main(String args[]){
		Scanner s = new Scanner(System.in);
		int T = s.nextInt();
		
		for(int i = 0; i<T; i++){
			
			int a, b;
			a = s.nextInt();
			b = s.nextInt();
			
			System.out.println("Case #"+(i+1)+": "+solve(a, b));
			
		}

	}
}