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.Arrays;
import java.util.HashSet;
import java.util.Scanner;


public class Solution {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
	    int T = scan.nextInt();
	    int[] counts = new int[T];
	    int max =2000001;
	    boolean[] used = new boolean[max];
	    for(int i=0;i<T;i++){
	    	int A = scan.nextInt();
	    	int B = scan.nextInt();
	    	counts[i]=count(A,B,used);	    	
	    }	
	    
	    for(int i=0;i<T;i++){
			System.out.println("Case #"+(i+1)+": "+counts[i]);
		}
	}
	
	public static int count(int A,int B,boolean[] used){
		int result=0;
		
		int num=0;
		int temp=A;
		
		int total=1;
		
		while(temp>0){
			temp=temp/10;
			num++;
			total*=10;
		}
		
		
		HashSet<Integer> set = new HashSet<Integer>();
		int rotato=0;
		int size =0;
		for(int i=A;i<=B;i++){
			if(!used[i]){
				set.clear();
				set.add(i);
				temp=i;
				int exp =1;
				
				for(int j=1;j<num;j++){
					exp*=10;
					rotato = (i%exp)*(total/exp)+i/exp;
				
					if(rotato>=A && rotato<=B){
						set.add(rotato);
						used[rotato]=true;
					}					
				}
				//System.out.println(size);
				size = set.size();
				if(size>1){
					result+=size*(size-1)/2;
				}				
			}
		}
		Arrays.fill(used, A,B,false);
		
		return result;
		
	}	
	
}
