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

}

package com.google.codejam;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumberSolver {

	public static int countRecycledNumber(int start, int end) {
		int count = 0;
		int numOfDigits = String.valueOf(start).length();
		Set<String> numberSet = new HashSet<String>(end - start + 1);
		
		for (int i = start; i <= end; i++) {
			numberSet.add(String.valueOf(i));
		}
		
		while(numberSet.isEmpty() == false) {
			Set<String> rotateList = new HashSet<String>(numOfDigits);
			String targetValue = numberSet.iterator().next();
			rotateList.add(targetValue);
			
			char[] buf = new char[numOfDigits * 2];		
			for (int i = 0; i < numOfDigits; i++) {
				buf[i] = buf[i + numOfDigits] = targetValue.charAt(i);
			}
			
			for (int i = 1; i < numOfDigits; i++) {
				if (buf[i] != '0') {
					String rotateValue = String.valueOf(buf, i, numOfDigits);
					int value = Integer.parseInt(rotateValue);
					if (value >= start && value <= end) {
						rotateList.add(rotateValue);
					}
				}
			}
			
			numberSet.removeAll(rotateList);
			if (rotateList.size() > 1) {
//				System.err.printf("rotate set: %s%n", rotateList.toString());
				count += rotateList.size() * (rotateList.size() - 1) / 2;
			}
		}
		
		return count;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

//		System.out.println("answer = " + RecycledNumberSolver.countRecycledNumber(10, 40));
		
		Scanner scanner = new Scanner(System.in);
		int totalCount = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < totalCount; i++) {
			String[] inputs = scanner.nextLine().split(" ");
			int answer = RecycledNumberSolver.countRecycledNumber(Integer.parseInt(inputs[0]), Integer.parseInt(inputs[1]));
			System.out.printf("Case #%d: %d%n", i+1, answer);
		}
		
	}

}
