/*
 * 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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.List;
import java.util.Map;
import java.util.regex.Pattern;

import com.google.common.collect.Lists;
import com.google.common.collect.Maps;

public class main {

	public static void main(String[] args) throws IOException{
		BufferedReader br  = new BufferedReader(new FileReader("C-small-attempt0.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
		Pattern pat = Pattern.compile(" ");
		String firstLine = (br.readLine());
		Integer numLines = new Integer(firstLine);
		Integer i;
		
		for(i=1;i<=numLines;i++){
			bw.write("Case #"+i+": ");
			String line = (br.readLine()).trim();
			String [] st= pat.split(line);
			Integer a = new Integer(st[0]);
			Integer b = new Integer(st[1]);
			bw.write(solve(a,b).toString());
			bw.newLine();
		}
		bw.close();
	}
	
	public static Integer solve(Integer a,Integer b){
		Integer i,j;
		Integer res=0;
		for(i=a;i<=b;i++){
			for(j=i+1;j<=b;j++){
				if(isRecycledPair(i,j)){
					res++;
				}
			}
		}
		return res;
	}
	public static Boolean isRecycledPair(Integer i, Integer j){
		Integer a;
		String iS= i.toString();
		String jS= j.toString();
		for(a=1;a<=iS.length();a++){
			iS=iS.substring(1)+iS.charAt(0);
			if(iS.charAt(0)!='0'){	
				if(iS.compareTo(jS)==0){
					return true;
				}
			}
		}
		return false;
	}
}
	