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

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

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


package y2012.Qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers extends IOStream {

	public RecycledNumbers(String fileName) {
		super(fileName);
	}

	private int runThisTestCase() throws IOException {
		Set<RecycledSet> recycledPairs = new HashSet<RecycledSet>();
		String[] limits = bufferedReader.readLine().split(" ");
		long a = Long.valueOf(limits[0]);
		long b = Long.valueOf(limits[1]);
		long num = a;

		while (num <= b) {
			String numString = String.valueOf(num);
			int numDigits = numString.length();
			for (int idx = 0; idx < numDigits; idx++) {
				String recycledString = numString.substring(idx)
				+ numString.substring(0, idx);

				long recycled = Long.valueOf(recycledString);
				if (recycled >= a && recycled <= b && num != recycled) {
					RecycledSet rs = new RecycledSet(num, recycled);
					recycledPairs.add(rs);
				}
			}
			num++;
		}
		
		return recycledPairs.size();
	}

	public static void main(String[] args) throws Exception {

		RecycledNumbers obj = new RecycledNumbers("/net/10.0.0.60/Users/454083/Desktop/Moshin/CodeJam/RecycledNumbers");
		try {
			obj.getReader();
			obj.getWriter();
			int testcases = Integer.parseInt(bufferedReader.readLine().trim());
			for (int testcase = 1; testcase <= testcases; testcase++) {
				int value = obj.runThisTestCase();
				bufferedWriter.write("Case #" + testcase + ": " + value + "\n");
				System.out.println("Case #" + testcase + ": " + value);
			}
			obj.close();
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

}

class RecycledSet {

	long num1;
	long num2;

	public RecycledSet(long num1, long num2) {
		if (num1 < num2) {
			this.num1 = num1;
			this.num2 = num2;
		} else {
			this.num1 = num2;
			this.num2 = num1;
		}
	}

	public int hashCode() {
		return (int) (num1 & num2);
	}

	public boolean equals(Object o) {
		if (o instanceof RecycledSet) {
			RecycledSet rs = (RecycledSet) o;
			if (this.num1 == rs.num1 && this.num2 == rs.num2) {
				return true;
			}
		}
		return false;

	}

}

class IOStream {

	static public BufferedReader bufferedReader = null;
	static public BufferedWriter bufferedWriter = null;

	String fileName = "";

	public IOStream(String fileName) {
		this.fileName = fileName;
	}

	protected void getReader() throws IOException {
		bufferedReader = new BufferedReader(new FileReader(new File(fileName
				+ ".in")));
	}

	protected void getWriter() throws IOException {
		bufferedWriter = new BufferedWriter(new FileWriter(new File(fileName
				+ ".out")));
	}

	protected void close() throws IOException {
		if (bufferedReader != null)
			bufferedReader.close();
		if (bufferedWriter != null) {
			bufferedWriter.flush();
			bufferedWriter.close();
		}
	}

	protected int[] splitString2Int(String[] words) {
		int[] ints = new int[words.length];
		int i = 0;
		for (String str : words) {
			ints[i] = Integer.parseInt(str);
			i++;
		}

		return ints;
	}
}
