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 codejam2012.qualification;

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class ProblemC {
    public static void main(String[] args) throws Exception {
        System.setIn(new FileInputStream("C-small-attempt0.in"));
        System.setOut(new PrintStream(new FileOutputStream("C-small-attempt0.out")));
        Scanner in = new Scanner(System.in);
        int testCase = in.nextInt();
        Set<Integer> duplicates = new TreeSet<>();
        
        for(int i = 1; i <= testCase; i++) {
            int a = in.nextInt(),
                b = in.nextInt();
            int count = 0;
            
            for(int n = a; n < b; n++) {
                String s = String.valueOf(n);
                String s2 = s+s;
                
                duplicates.clear();
                for(int j = 1, len = s.length(); j < len; j++) {
                    int m = Integer.parseInt(s2.substring(j, j+len));
                    if(m > n && m <= b && !duplicates.contains(m)) {
                        count++;
                        duplicates.add(m);
                    }
                }
            }
            System.out.printf("Case #%d: %d%n", i, count);
        }
    }
}
