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.*;
import java.io.*;
import java.lang.*;

class RecycledNumbers { 
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int T = Integer.parseInt(sc.nextLine());
    boolean[] taken = new boolean[2000001];
    
    for (int i=0; i<T; i++) {
    	int count = 0;
    	String[] dat = sc.nextLine().split(" ");
    	Arrays.fill(taken, false);
    	int digits = dat[0].length();
    	int A = Integer.parseInt(dat[0]);
    	int B = Integer.parseInt(dat[1]);
    	for (int j=A; j<=B; j++) {
    		if (!taken[j]) {
    			//System.out.println(j);
    			taken[j] = true;
    			int c = 1;
    			for (int k=1; k<digits; k++) {
    				int rem = j % (int)Math.pow(10, k);
    				int res = rem * (int)Math.pow(10, digits-k) + j / (int)Math.pow(10, k);
    				if (A <= res && res <= B && j != res && !taken[res]) { taken[res] = true; c++; }
    			}
    			if (c > 1) {
    				//System.out.println(j+" "+c);
						int r = 0;
						for (int k=c-1; k>=1; k--) r += k;
						count += r;
					}
    		}
    	}
    	
    	/*int cc= 0;
    	for (int a=A; a<=B; a++) {
    		for (int b=a+1; b<=B; b++) {
    			boolean found = false;
    			for (int k=1; k<digits; k++) {
    				int rem = a % (int)Math.pow(10, k);
    				int res = rem * (int)Math.pow(10, digits-k) + a / (int)Math.pow(10, k);
    				if (res == b) { found = true; break; }
    			}
    			if (found) { cc++; }
    		}
    	}
    	System.out.println(cc);*/
    	System.out.println("Case #" + (i+1) + ": " + count);
    }
  }
}

