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();
	}

}
package com.vlad;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new File(args[0]));
        FileWriter writer = new FileWriter("c-out.txt");
        int T = scanner.nextInt();
        for(int i=0;i<T;i++) {
            int A = scanner.nextInt();
            int B = scanner.nextInt();
            if(i>0) writer.append("\n");
            int s1 = solve(A,B);
            //int s2 = solveAlt(A,B);
            //if(s1!=s2) System.out.println("$$$ - " + i);
            writer.append("Case #"+(i+1)+": " + s1);
        }
        writer.flush();
    }

    private static int solveAlt(int A, int B) {
        Set<String> used = new HashSet<String>();
        int res = 0;
        for(int i=A;i<B;i++) {
            int len = getLen(i);
            used.clear();
            String m = i+"";
            for(int j=1;j<len;j++) {
                String pp = m.substring(j) + m.substring(0,j);
                int p = Integer.parseInt(pp);
                // TODO <=B
                if(p>i && p<=B) {
                    if(used.contains(pp)) continue;
                    used.add(pp);
                    res++;
                }
            }
        }
        return res;
    }

    private static int solve(int A, int B) {
        Set<Integer> used = new HashSet<Integer>();
        int res = 0;
        for(int i=A;i<B;i++) {
            int len = getLen(i);
            used.clear();
            for(int j=1;j<len;j++) {
                int p = getShifted(i, j, len);
                if(p>i && p<=B) {
                    if(used.contains(p)) continue;
                    used.add(p);
                    res++;
                }
            }
        }
        return res;
    }

    private static int getShifted(int i, int j, int len) {
        int v = (int)Math.pow(10,j);
        int x = (int)Math.pow(10,len-j);
        return i/v + i%v*x;
    }

    private static int getLen(int i) {
        int len = 1;
        int val = 10;
        while (i>val-1) {
            len++;
            val*=10;
        }
        return len;
    }
}
