/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

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

}
