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 code_jam_quali;

import java.util.HashSet;
import java.util.Scanner;

/**
 *
 * @author sansarun
 */
public class Recycled {

    public static void main(String[] args) {        
        Scanner sc = new Scanner(System.in);
        int caseNumber = sc.nextInt();

        for(int currentCase=1; currentCase<=caseNumber; currentCase++) {
            HashSet<NumberPair> recycledPairSet = new HashSet<NumberPair>();
            int a = sc.nextInt();
            int b = sc.nextInt();
            int digit = (""+a).length();

            for(int n=a; n<b; n++) {
                StringBuilder nString = new StringBuilder(""+n);

                for(int j=0; j<digit; j++) {
                    rotate(nString);
                    int m = Integer.valueOf(nString.toString());
                    
                    if(m > n && m <= b) {
                        recycledPairSet.add(new NumberPair(n, m));
                    }
                }
            }           

            System.out.println(String.format("Case #%d: %d", currentCase, recycledPairSet.size()));
        }    

    }

    private static StringBuilder rotate(StringBuilder s) {
        if(s.length() == 0)
            return s;

        s.insert(0, s.charAt(s.length() - 1));
        s.deleteCharAt(s.length() - 1);
        return s;
    }
}

class NumberPair {

    private int a;
    private int b;

    public NumberPair(int a, int b) {
        this.a = a;
        this.b = b;
    }

    @Override
    public boolean equals(Object obj) {
        if (!(obj instanceof NumberPair)) {
            return false;
        }

        NumberPair n = (NumberPair) obj;
        if (n.a == a && n.b == b) {
            return true;
        } else if (n.a == b && n.b == a) {
            return true;
        } else {
            return false;
        }
    }

    @Override
    public int hashCode() {
        return a+b;
    }
}
