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 R2012;

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

public class RecycledNumbers {

	public static boolean isCycle(int a,int b) {
		String aa=String.valueOf(a);
		StringBuffer ba=new StringBuffer(String.valueOf(b));
		if(aa.length()!=ba.length())
			return false;
		int l=aa.length();
		for(int i=0;i<l;++i)
		{
			if(aa.equals(ba.toString()))
				return true;
			ba.append(ba.charAt(0));
			ba.deleteCharAt(0);
		}
		return false;
	}
	public static boolean sameLen(int a,int b) {
		return String.valueOf(a).length()==String.valueOf(b).length();
	}
	public static void main(String[] args) {
		int T,count,a,b,num;
		try {
			FileWriter out = new FileWriter("d://test//Cs.out");  
			//Scanner in=new Scanner(System.in);
			Scanner in=new Scanner(new File("d://test//Cs.in"));
			T=in.nextInt();
			count=0;
			while((++count)<=T)
			{
				a=in.nextInt();
				b=in.nextInt();
				num=0;
				for(int i=a;i<=b;++i)
					for(int j=i+1;sameLen(i, j)&&j<=b;++j)
						if(isCycle(i, j))
							++num;
				
				out.write("Case #"+count+": "+num+"\r\n"); 
			}
			
			in.close(); 
			out.close();  
		} catch (Exception exc) {
			exc.printStackTrace();
		}
	}

}
