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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
package codejam.codejam_2012;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

/**
 * Created by IntelliJ IDEA.
 * User: csrazvan
 * Date: 14.04.2012
 * Time: 13:44
 * To change this template use File | Settings | File Templates.
 */
public class RecycledNumbers {
    public int formNumber(ArrayList<Integer> rotation) {
        int nr = 0;
        for (Integer i : rotation) {
            nr = nr * 10 + i;
        }
        return nr;

    }

    public ArrayList<Integer> getRotations(int nr) {
        ArrayList<Integer> result = new ArrayList<Integer>();
        ArrayList<Integer> rotation = new ArrayList<Integer>();
        int digits = 0;
        while (nr > 0) {
            rotation.add(0, nr % 10);
            digits++;
            nr = nr / 10;
        }
        for (int i = 0; i < digits - 1; i++) {
            rotation.add(rotation.get(0));
            rotation.remove(0);
            result.add(formNumber(rotation));
        }


        return result;
    }

    public void solve(File f) throws Exception {
        Scanner scanner = new Scanner(f);
        File w = new File("recycled.out");
        BufferedWriter bw = new BufferedWriter(new FileWriter(w));
        int t = scanner.nextInt();
        for (int i = 1; i <= t; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            int count = 0;
            HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();

            for (int startValue = a; startValue <= b; startValue++) {
                ArrayList<Integer> rotations = getRotations(startValue);
                for (int rotation : rotations) {
                    if (rotation >= a && rotation <= b && startValue < rotation) {
                        if (map.containsKey(startValue) && map.get(startValue) == rotation) {
                        } else if (map.containsKey(rotation) && map.get(rotation) == startValue) {
                        } else {
                            map.put(startValue, rotation);
                            count++;
                        }

                    }
                }

            }
            bw.write(String.format("Case #%s: %s\n",i,count));
        }
        bw.close();
    }

    public static void main(String[] args) {
        try {
            new RecycledNumbers().solve(new File("recycled.in"));
        } catch (Exception e) {
            e.printStackTrace();
        }


    }
}
