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

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.StringTokenizer;


public class Problem2 {
	private static HashSet<String> circularSet = new HashSet<String>();
	
	private static void shift(final long orgNumber_,final long numberN_,final long numberM_){
		String orgStr = (""+orgNumber_);
		if(orgStr.length() < 2){
			return;
		}
		
		String retString = null;
		String cirKey = null;
		long shifted = -1;
		for(int i=0;i<orgStr.length();i++){
			retString = orgStr.substring(i+1)+orgStr.substring(0,i+1);
			if(retString.charAt(0) == '0'){
				return;
			}
			
			shifted = Long.parseLong(retString);
			
			if(shifted > 0 && shifted != orgNumber_ && shifted >= numberN_ && shifted <= numberM_){
				cirKey = orgNumber_ < shifted ? orgStr+"_"+shifted : shifted+"_"+orgStr;
				if(!circularSet.contains(cirKey)){
//					System.out.println(cirKey);
					circularSet.add(cirKey);
//				}else{
//					System.out.println(cirKey);
				}
			}
		}
		
		
	}
	
	public static void main(String args[]){
		File inputFile = new File(args[0]);
		File outputFile = new File(args[0]+"_out");
		
		try {
			BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
			BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(outputFile)));
			int testCases = Integer.parseInt(br.readLine());
			
			String givenNumbers = null;
			for(int i=0;i<testCases;i++){
				givenNumbers = br.readLine();
				StringTokenizer strToken = new StringTokenizer(givenNumbers, " ");
				
				long numberN = Long.parseLong(strToken.nextToken());
				long numberM = Long.parseLong(strToken.nextToken());
				for(long start = numberN ; start <= numberM ; start++){
					shift(start, numberN, numberM);
				}
				
				String result = "Case #"+(i+1)+": "+circularSet.size()+"\n";
				System.out.print(result);
				bw.write(result);
				bw.flush();
				
				circularSet.clear();
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}
}
