/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;


public class Prob3 {

	
	public static void main(String[] args) throws NumberFormatException, IOException {
//		String filePath = "C://Users//Apoorv//Desktop//test1.txt";
		String filePath = "C://Users//Apoorv//Downloads//C-small-attempt0.in";
		BufferedReader br2 = new BufferedReader(new InputStreamReader(
				new DataInputStream(new FileInputStream(filePath))));

		FileWriter fstream = new FileWriter(
				"C://Users//Apoorv//Dropbox//Code//workspace//CodeJam//src//tempAnswer.txt");
		BufferedWriter out = new BufferedWriter(fstream);

		String str = null;
		long count = 0;
		Integer numCases = 0;
		numCases = Integer.parseInt(br2.readLine());
		for (int curCase = 0; curCase < numCases; curCase++) {
			System.out.print("Case #" + (curCase + 1) + ": ");
			out.write("Case #" + (curCase + 1) + ": ");
			str = br2.readLine();
			String[] tokens = str.split(" ");
			
			int num1 = Integer.parseInt(tokens[0]);
			int num2=  Integer.parseInt(tokens[1]);
			int curLength = getLength(num1);
			int countOfPossibilities=0;
			for (Integer curNumber = num1;curNumber<num2;curNumber++){
				String numString1 = curNumber.toString();
				char[] charArray1 = numString1 .toCharArray();
				for(int curIteration = curLength;curIteration>1;curIteration--){
					char[] charArrayBuilding = new char[charArray1.length];
					for(int i=0;i<curLength;i++){
						charArrayBuilding[i] = charArray1[(curIteration-1+i) % (curLength)];	
					}
					StringBuilder g = new StringBuilder();
					for(int i=0;i<charArrayBuilding.length;i++){
//						System.out.print(charArrayBuilding[i]);
						g.append(charArrayBuilding[i]);
					}
//					System.out.print(",");
					
					
					int newNumber=Integer.parseInt(g.toString());
					if(newNumber>curNumber && newNumber<=num2 && getLength(newNumber)==curLength){
						countOfPossibilities++;
						System.out.print(newNumber + ",");
//						out.write(newNumber + ",");
					}
				}
			}
			System.out.println(countOfPossibilities);
			out.write(countOfPossibilities + "\n");
		}
		out.close();
	}

	private static int getLength(int num1) {
		int exponent = 1;
		while(true){
			num1/=10;
			if(num1==0){
				return exponent;
			}
			else
				exponent++;
		}		
	}
}

