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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;


public class RecycledNumbers {
  public static String input = "easy.txt";
  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new FileReader(input));
    
    int n = Integer.parseInt(in.readLine());
    for (int i = 1; i <= n; i++) {
      String line = in.readLine();
      int idx1 = line.indexOf(' ');
      int a = Integer.parseInt(line.substring(0, idx1));
      int b = Integer.parseInt(line.substring(idx1 + 1));
      
      long totalCount = 0;
      Map<Map<Integer, Integer>, Long> signatureMap = new HashMap<Map<Integer, Integer>, Long>();
      
      for (int x = a; x <= b; x++) {
        totalCount += recycledNums(x, b);
      }
      
      System.out.println("Case #" + i + ": " + totalCount);
    }
  }

  private static int recycledNums (int n, int max) {
    List<Integer> digits = new LinkedList<Integer>();
    
    int remaining = n;
    while (remaining > 0) {
      int digit = remaining % 10;
      digits.add(digit);
      remaining /= 10;
    }
    
    //System.out.println("<<" + n + ">>");
    Set<Integer> nums = new HashSet<Integer>();
    for (int i = 0; i < digits.size() - 1; i++) {
      int n0 = digits.remove(0);
      digits.add(n0);
      int recycled = numFromList(digits);
      //System.out.println(recycled);
      if (recycled > n && recycled <= max) nums.add(recycled);
    }
    
    //System.out.println(n + ": " + nums);
    
    return nums.size();
  }
  
  private static int numFromList(List<Integer> list) {
    int num = 0;
    for (int i = list.size() - 1; i >= 0; i--) {
      num *= 10;
      num += list.get(i);
    }
    return num;
  }
}
