/*
 * 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 google.contest.B;

import google.loader.Challenge;
import google.problems.AbstractChallenge;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

public class BChallenge extends AbstractChallenge implements Challenge {

	private int numberOfGooglers;
	private int numberOfSurprise;
	private int desiredScore;
	List<Integer> scores;
	private String resultNumber;
	private static  HashMap<Integer, ScoreInfo> map;

	public BChallenge(int number, String line) {
		super(number);

		String[] tokens = line.split(" ");

		numberOfGooglers = Integer.parseInt(tokens[0]);
		numberOfSurprise = Integer.parseInt(tokens[1]);

		desiredScore = Integer.parseInt(tokens[2]);

		scores = new ArrayList<Integer>();
		for(int i=0;i<numberOfGooglers;i++){
			scores.add(Integer.parseInt(tokens[3+i]));
		}
		calculate();

		setResult(resultNumber);
	}

	private void calculate() {
		if(map == null){
			init();
		}

		// teile in bigger und nicht bigger
		List<Integer> bigger = new ArrayList<Integer>();
		List<Integer> biggerAndSurprising = new ArrayList<Integer>();
		List<Integer> smaller = new ArrayList<Integer>();
		List<Integer> smallerAndSuprising = new ArrayList<Integer>();
		for(Integer score : scores ){
			ScoreInfo info = getScoreInfo(score);
			if(info.canBeBigger(desiredScore)){
				if(info.mustBeSuprisingBeingBigger(desiredScore)){
					biggerAndSurprising.add(score);	
				}else{
					bigger.add(score);
				}
			}else{
				if(info.canBeSuprising()){
					smallerAndSuprising.add(score);
				}else{
					smaller.add(score);
				}
			}
		}

		int biggerSize = bigger.size();
		int biggerAndSuprSize = biggerAndSurprising.size();
		int smallerSize = smaller.size();
		int smallerAndSupSize = smallerAndSuprising.size();
		
		if(biggerAndSuprSize>=numberOfSurprise){
			resultNumber = ""+ ( biggerSize + numberOfSurprise);
			return;
		}
			resultNumber = ""+ (biggerSize + biggerAndSuprSize);
		
	}

	private ScoreInfo getScoreInfo(Integer score) {
		return map.get(score);
	}

	private void init() {
		map = new HashMap<Integer, ScoreInfo>();
		for(int i=0;i<11;i++){
			for(int j=0;j<11;j++){
				for(int k=0;k<11;k++){
					addTripple(i,j,k);
				}
			}
		}

	}

	private void addTripple(int i, int j, int k) {

		int sum = i+j+k;
		if(! map.containsKey(sum)){
			map.put(sum, new ScoreInfo(sum));
		}
		map.get(sum).addTripple(i,j,k);

	}



	private static class ScoreInfo{

		private List<Tripple> tripples;

		public ScoreInfo(int sum) {
			tripples = new ArrayList<BChallenge.Tripple>();
		}

		public boolean mustBeSuprisingBeingBigger(int desiredScore) {
			
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					if(!tripple.isSuprising()){
						return false;
					}
				}
			}
			return true;
		}

		public boolean canBeBiggerAndSuprising(int desiredScore) {
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					if(tripple.isSuprising()){
						return true;
					}
				}
			}
			return false;
		}

		public boolean canBeBigger(int desiredScore) {
			for(Tripple tripple : tripples){
				if(tripple.isBigger(desiredScore)){
					return true;
				}
			}
			return false;
		}

		public boolean canBeSuprising() {
			for(Tripple tripple : tripples){
				if(tripple.isSuprising()){
					return true;
				}
			}
			return false;
		}

		public void addTripple(int i, int j, int k) {
			Tripple tripple = new Tripple(i,j,k);
			if(tripple.isValid()){
				tripples.add(tripple);
			}

		}

	}

	private static class Tripple{

		private final int i;
		private final int j;
		private final int k;

		public Tripple(int i, int j, int k) {
			this.i = i;
			this.j = j;
			this.k = k;
		}


		public boolean isBigger(int desiredScore) {
			return i>=desiredScore || j>=desiredScore || k>=desiredScore;
		}


		public boolean isSuprising() {
			return 2==getMaxDifference();
		}


		private boolean isValid() {
			int max = getMaxDifference();
			return max<3;
		}

		private int getMaxDifference() {
			int a1 = Math.abs(i-j);
			int a2 = Math.abs(i-k);
			int a3 = Math.abs(k-j);

			int max = Math.max(Math.max(a1,a2), a3);
			return max;
		}

	}



}
