/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;


public class ProblemaC {
	
	private final static String RUTA="C:/Users/Rafael/Documents/Estudio/OtherStuff/Google/CodeJam/ProblemaC/";
	
	public ProblemaC(){
		try {
			FileOutputStream fos=new FileOutputStream(new File(RUTA+"resultado.txt"));
			BufferedReader br=new BufferedReader(new FileReader(RUTA+"C-small-attempt3.in"));
			PrintWriter pw=new PrintWriter(fos);
			
			String a=br.readLine();
			System.out.println("Ignore"+a);
			int contador=0;
			while((a=br.readLine())!=null)
			{
				contador++;
				System.out.println("Case #"+contador+": "+a);
				String first=a.split(" ")[0];
				String second=a.split(" ")[1];
				int temp=analizar(first, second);
				System.out.println(temp);
				pw.println("Case #"+contador+": "+temp );
			}
			pw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public int analizar(String first, String second ){
		ArrayList<String> dupList=new ArrayList<String>();
		int contador=0;
		int primero=Integer.parseInt(first);
		int segundo=Integer.parseInt(second);
		for(int i=primero;i<=segundo;i++){
			for(int j=i+1;j<=segundo;j++){
				for(int k=1;k<first.length();k++){
					String uno=""+i;
					String dos=""+j;
					String fm=convert(k, uno);
					if(fm.equals(dos)&&!dupList.contains(uno+"-"+dos))
					{
						if(uno.startsWith("0")||dos.startsWith("0")){						
							System.out.println(uno+"-"+dos);
						}
//						System.out.println(uno+","+dos);
						contador++;
						dupList.add(uno+"-"+dos);
					}
				}
			}
		}
		return contador;
	}
	
	public String convert(int k, String primero){
		String acumulador="";
		for(int i=0;i<k;i++)	
		{
			acumulador=primero.charAt(primero.length()-1)+acumulador;
			primero=primero.substring(0, primero.length()-1);
		}
		primero=acumulador.concat(primero);
		
		return primero;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
			new ProblemaC();
	}
}
