package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

package com.cj.utils;

import java.io.*;
import java.util.*;

public class InputReader {
    //public ArrayList<String> inputs;
    public int cases;
    public Scanner scanner;
    public InputReader(){
        //inputs = new ArrayList<String>();
        cases = 0;
    }
    public Scanner loadInput(String fileName){
        try{
            File file = new File(fileName);
            scanner = new Scanner(file);
            cases = scanner.nextInt();
            //for(int count = 0; count < cases ; count++){}
            return scanner;
        }
        catch(Exception ex){ex.printStackTrace(); return null;}

    }
    
    public static void main(String[] args){
    	InputReader ir = new InputReader();
        Scanner input = ir.loadInput("test.txt");
        int cases = ir.cases;
        System.out.println(cases);
        System.out.println(input.nextInt()+"mm"+input.nextInt());
    }

}