package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeMap;


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader bufferRead = new BufferedReader(new InputStreamReader(System.in));
		String line;
		Integer i = 1;
		Integer licz = 0;
		boolean first = true; 
		try {
			while ((line = bufferRead.readLine()) != null && line.length()!= 0)
			{
				if (first)
				{
					licz = Integer.parseInt(line);
					first = false;
				}
				else
				{
					System.out.print("Case #" + i +": ");
					// tu wlasciwe obliczenie
					String[] split = line.split(" ");
					policzRececled(split[0], split[1]);
					System.out.println();
					i++;
					licz--;
				}
				if (licz < 0)
					break;
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static int policzRececled(String A, String B) {
		if (A.length() == 1)
		{
			System.out.print("0");
			return 0;
		}
		Map<String,Integer> map = new HashMap<String, Integer>();
		Integer licznikPar = 0;
		Integer min = Integer.parseInt(A);
		Integer max = Integer.parseInt(B);
		for (Integer X = min; X <= max; ++X)
		{
			String S = X.toString();
			for (int i = 1; i < A.length(); ++i)
			{
				String subS = S.substring(0, i);
				String subE = S.substring(i);
				String sNew = subE + subS;
				Integer iNew = Integer.parseInt(sNew);
				if (X < iNew && iNew >= min && iNew <= max)
				{
					String ss = "" + X + iNew;
					if (map.containsKey(ss))
					{
						Integer j = map.get(ss);
						j++;
						map.put(ss, j);
					}
					else
					{
						map.put(ss, 1);
					}
					//System.out.println(licznikPar + ": " + X + " -> " + iNew);
					//licznikPar++;
				}
			}
		}
		System.out.print(map.size());
		/*
		System.out.println();
		Set<Entry<String, Integer>> entrySet = map.entrySet();
		int ii = 1;
		for (Entry<String, Integer> entry : entrySet) {
			System.out.println(ii + ": " + entry.getKey() + " -> " + entry.getValue());
			ii++;
		}
		*/
		return 0;
	}

}
