import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
package qualification;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

import loader.InputReader;
import loader.OutPutWriter;

public class RecycledNumber {

	static String inputName = "C-small-attempt0.in";
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
//		List<Integer> list = new LinkedList<Integer>();
//		list.add(1);
//		list.add(2);
//		System.out.println(listToInt(list));
//		int a = 4009;
//		System.out.println(intToList(a));
		start();
	}

	private static void start(){
		InputReader reader = new InputReader();
		reader.read(inputName);
		List<String> inputs = reader.getInputs();
		List<String> outputs = new ArrayList<String>();
		for(String in: inputs){
			String[] aLine = in.split(" ");
			int a = Integer.parseInt(aLine[0]);
			int b = Integer.parseInt(aLine[1]);
			int amount = findPairs(a,b);
			outputs.add(new Integer(amount).toString());
		}
		
		OutPutWriter writer = new OutPutWriter();
		writer.write("question3.out", outputs);
	}
	
	private static int findPairs(int a, int b) {
		Set<Pair> resultSet = new HashSet<Pair>();
		
//		int res = 0;
		if(a == b) return 0;
		for(int n=a; n<b; n++){
			List<Integer> nList = intToList(n);
			int shiftTimes = nList.size()-1;
			for(int i=1; i<=shiftTimes; i++){
				int m = shift(i, nList);
				if(n < m && m <= b){
					Pair pair = new Pair(n, m);
//					res += 1;
					if(!resultSet.contains(pair))
						resultSet.add(pair);
				}
			}
		}
		List view = new ArrayList(resultSet);
		Collections.sort(view);
		System.out.println(view);
		
		return resultSet.size();
//		return res;
	}

	private static int shift(int shiftTimes, List<Integer> list){
		
		List<Integer> copyList = new ArrayList<Integer>();
		copyList.addAll(list);
		for(int i=0; i<shiftTimes; i++){
			Integer moved = copyList.remove(0);
			copyList.add(moved);
		}
		
		return listToInt(copyList);
	}

	
	private static List<Integer> intToList(int a){
		List<Integer> l = new LinkedList<Integer>();
		
		while(a > 0){
			int digit = a%10;
			l.add(0, digit);
			a /= 10;
		}
		
		return l;
	}
	
	private static int listToInt(List<Integer> list){
		int res = 0;
		int length = list.size();
		
		int pow = 0;
		for(int i=length-1; i>=0; i--){
			int digit = list.get(i);
			int value = (int) (digit * Math.pow(10.0, pow));
			res += value;
			pow++;
		}
		return res;
	}
}
