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.FileReader;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class go3 {

    public static final String IN_FILE = "C-small-attempt0.in";
    public static final String OUT_FILE = "out.txt";


    public static void main(String[] args) throws Throwable {

        try (LineNumberReader reader = new LineNumberReader(new FileReader(IN_FILE))) {
            try (PrintWriter writer = new PrintWriter(OUT_FILE)) {

                int T = Integer.parseInt(reader.readLine());

                //Tests
                for (int t = 1; t <= T; t++) {

                    Scanner scanner = new Scanner(reader.readLine());
                    int LOW = scanner.nextInt();
                    int HIGH = scanner.nextInt();

                    HashSet<Pair> pairs = new HashSet<>();

                    for(int i = LOW; i <= HIGH ; i++) {

                        Set<Integer> set = validPermutations(i,LOW,HIGH);
                        Integer[] permutations = set.toArray(new Integer[0]);
                        Arrays.sort(permutations);

                        for(int n = 0; n < permutations.length ; n++){
                            for(int m = n+1; m < permutations.length; m++) {
                                pairs.add(new Pair(permutations[n],permutations[m]));
                            }
                        }
                    }
                    writer.printf("Case #%d: %s\n", t, pairs.size());
                }
            }
        }

    }

    public static Set<Integer> validPermutations (Integer n,int LOW, int HIGH){
        int lastIndex = n.toString().length() - 1;
        StringBuilder b = new StringBuilder(n.toString());
        Set<Integer> result = new HashSet<>();

        result.add(Integer.parseInt(b.toString()));

        for(int i = 1 ; i <= lastIndex; i++){

            char c = b.charAt(lastIndex);
            if (c == '0') continue;

            b = b.deleteCharAt(lastIndex).insert(0,c);

            int k = Integer.parseInt(b.toString());

            if(k >= LOW && k <= HIGH){
                result.add(k);
            }
        }

        return result;
    }
}

class Pair {
    int n;
    int m;

    Pair(int n, int m) {
        this.n = n;
        this.m = m;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        Pair pair = (Pair) o;

        if (m != pair.m) return false;
        if (n != pair.n) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = n;
        result = 31 * result + m;
        return result;
    }

    @Override
    public String toString() {
        return "(" + n + "," + m + ")";
    }
}