/*
 * 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();

    }

}

/**
 * 
 */
package code.google.codejam;

import java.util.HashSet;



/**
 * @author sunilkumarp
 *
 */
public class RecycledNumbers extends Template {
	
	int A = 0;
	
	int B = 0;
	
	int digits = 0;
	
	int[] n = null;
	
	int m = 0;

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#doSolveProblem()
	 */
	@Override
	protected Object doSolveProblem() throws Exception {
		if (A >= B) {
			return 0;
		}
		int result = 0;
		n = new int[digits];
		int counter = digits;
		int A_ = A;
		for (;--counter >= 0;) {
			n[counter] = A_ % 10;
			A_ = A_ / 10;
		}
		
		counter = B - A;
		for (int i = 0; i < counter; ++i) {
			HashSet<Integer> unique = new HashSet<Integer>();
			for (int j = 1; j < digits; ++j) {
				if (isGreaterThanA(j) && isLessOrEqThanB(j)) {
					if(unique.add(m)) {
						++result;
					} continue;
					
				}
			}
			incrementA();
		}
		return result;
	}

	private boolean isLessOrEqThanB(int j) {
		return m <= B;
	}
	
	private boolean isGreaterThanA(int j) {
		m = 0;
		for (int k = j; k < digits; ++k) {
			m *= 10;
			m += n[k];
		}
		
		for (int k = 0; k < j; ++k) {
			m *= 10;
			m += n[k];
		}
		
		int A_ = 0;
		for (int k = 0; k < digits; ++k) {
			A_ *= 10;
			A_ += n[k];
		}
		
		return m > A_;
	}
	
	/*private boolean isLessOrEqThanB(int j) {
		boolean notSwitched = true;
		for (int i = 0; i < digits; ++i) {
			if (notSwitched && i+j == digits) {
				j = -i;
				notSwitched = false;
			}
			if (b[i] > a[i+j]) {
				return true;
			} else if (b[i] < a[i+j]) {
				return false;
			}
		}
		return true;
	}

	private boolean isGreaterThanA(int j) {
		boolean notSwitched = true;
		for (int i = 0; i < digits; ++i) {
			if (notSwitched && i+j == digits) {
				j = -i;
				notSwitched = false;
			}
			if (a[i] > a[i+j]) {
				return false;
			} else if (a[i] < a[i+j]) {
				return true;
			}
		}
		return false;
	}*/

	private void incrementA() {
		for (int i = digits - 1; i >= 0; --i) {
			if ((n[i] += 1) == 10) {
				n[i] = 0;
			} else {
				break;
			}
		}
		
	}

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#printInput()
	 */
	@Override
	protected void printInput() throws Exception {
		System.out.println("Digits-" +digits + ":" + A + "-" + B);

	}

	/* (non-Javadoc)
	 * @see code.google.codejam.Template#initializeTestCase()
	 */
	@Override
	protected void initializeTestCase() throws Exception {
		readLine();
		A = readNextInteger();
		digits = linePointer;
		B = readNextInteger();
	}

}
