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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.File;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;


public class Recycled {
	
	public static Integer reorder(int n) {
		int newn = n, digits = 0, greatest = 0, scale = 1;
		while (newn > 0) {
			newn /= 10;
			digits++;
			scale *= 10;
		}
		scale /= 10;
		int temp = 0;
		for (int i = 0; i < digits; i++) {
			temp = n;
			temp /= 10;
			temp += scale * (n-(10*temp));
			n = temp;
			greatest = Math.max(n,greatest);
		}
		
		return greatest;
	}
	
	public static void main(String[] args) {
		
		String fileName;
		String line;
		fileName = "C-small-attempt0.in";
		
		Scanner fromFile = null;
		try {
			fromFile = new Scanner(new File(fileName));
		} catch (Exception e) {}
		
		int iterations = Integer.parseInt(fromFile.nextLine());
		int count, lower, upper;
		int[] answers = new int[iterations];
		HashMap<Integer,Integer> map = null;
		Integer ordered = null;
		
		for (int i = 0; i < iterations; i++) {
			
			line = fromFile.nextLine();
			String[] arguments = line.split(" ");
			lower = Integer.parseInt(arguments[0]);
			upper = Integer.parseInt(arguments[1]);
			count = 0;
			map = new HashMap<Integer,Integer>();
			
			for (int j = lower; j <= upper; j++) {
				ordered = reorder(j);
				if (map.containsKey(ordered)) {
					int number = map.get(ordered);
					count += number;
					map.put(ordered, number+1);
				} else {
					map.put(ordered, 1);
				}
			}
			
			answers[i] = count;
		}
		
		try {
			fromFile.close();
		} catch (Exception e){}
		
		PrintWriter toFile = null;
		try {
			File f = new File("output.txt");
			if (!f.exists())
				f.createNewFile();
			toFile = new PrintWriter(f);
		
			for (int i = 0; i < iterations; i++) {
				if (i == iterations - 1) {
					toFile.print("Case #" + (i + 1) + ": " + answers[i]);
				} else {
					toFile.println("Case #" + (i + 1) + ": " + answers[i]);
				}
			}
			
			toFile.close();
		
		} catch (Exception e) {}
	}
}
