/*
 * 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.IOException;
import java.io.InputStreamReader;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.Vector;


public class RecycledNumbers {


	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		String strNumberOfSentences = "";
		InputStreamReader converter = new InputStreamReader(System.in);
		BufferedReader in = new BufferedReader(converter);
		    
		Integer numberOfSentences = -1;
		MyPair[] sentences = null;
		try {
			strNumberOfSentences = in.readLine();
		
			numberOfSentences = Integer.parseInt(strNumberOfSentences);
			sentences = new MyPair[numberOfSentences];
			
			for ( int i = 0; i < numberOfSentences; ++i) {
				sentences[i] = new MyPair(in.readLine());
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		if ( numberOfSentences == -1) {
			return;
		}
		
		Vector<MyPair> usedNumbers = new Vector<MyPair>();
		
		for ( int i = 0; i < numberOfSentences; ++i) {
			
			int curr = sentences[i].lowerLimit;
			while (curr < sentences[i].higherLimit) {
				StringBuilder sss = new StringBuilder("");
				
				sss.append(String.valueOf(curr));
				StringBuilder sss2 = new StringBuilder(String.valueOf(curr));
				for (int ii = 0; ii < sss.length()-1; ++ii) {
					
					char temp = sss2.charAt(0);
					sss2.replace(0, 0, String.valueOf(sss2.charAt(sss2.length()-1)));
					sss2.delete(sss2.length()-1, sss2.length());
					
					if (Integer.parseInt(sss2.toString()) <= sentences[i].higherLimit && 
						Integer.parseInt(sss2.toString()) >= sentences[i].lowerLimit &&
						
						Integer.parseInt(sss.toString()) < Integer.parseInt(sss2.toString()) ) {
						MyPair x = new MyPair(Integer.parseInt(sss.toString()),Integer.parseInt(sss2.toString()));
						boolean isFound = false;
						for (int kkk =0; kkk < usedNumbers.size(); ++kkk ){
							if ( usedNumbers.get(kkk).sameAs(x) ) {
								isFound = true;
							}
						}
						if ( !isFound ) {
							usedNumbers.add(x);
							//System.out.println("" + curr + ": " + x.lowerLimit + "," + x.higherLimit );
						}
					}
				}
				curr++;
			}
			
			System.out.println("Case #" + new Integer(i+1).toString() + ": " + usedNumbers.size() );
			SortedSet<Integer> usedNumbers2 = new TreeSet<Integer>();
			for (int kkk =0; kkk < usedNumbers.size(); ++kkk ){
				if ( !usedNumbers2.contains(usedNumbers.get(kkk).lowerLimit) ) {
					usedNumbers2.add(usedNumbers.get(kkk).lowerLimit);	
				}
				if ( !usedNumbers2.contains(usedNumbers.get(kkk).higherLimit) ) {
					usedNumbers2.add(usedNumbers.get(kkk).higherLimit);	
				}
			}
			for (Integer item: usedNumbers2 ){
				//System.out.println("" + item.toString() );	
			}
			
			usedNumbers.clear();
			
			
		}
		
		

	}

}



/*			
			int length = sentences[i].lowerLimit.length();
			
			if ( length == 0 || length == 1) {
				numberOfShits = 0;
			}
			else if ( length == 2) {
				int iii = 
						Character.digit(sentences[i].higherLimit.charAt(0),10) - 
						Character.digit(sentences[i].lowerLimit.charAt(0),10);
				
				numberOfShits *= iii * 2;
			}
			else if ( length > 2) {
				numberOfShits = (int) Math.pow(10, length-2);
				int iii = 
						Character.digit(sentences[i].higherLimit.charAt(0),10) - 
						Character.digit(sentences[i].lowerLimit.charAt(0),10);
				
				numberOfShits *= iii * iii;
				numberOfShits -= iii;
			}
			
			
			*/