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

import java.io.*;
import java.util.HashSet;
import java.util.Set;

/**
 * @author Dmitry Korolev
 */
public class Task3 {

    public static void main(String[] args) throws IOException {
        Reader inputReader = new FileReader("C-small-attempt0.in");
        Writer outputWriter = new FileWriter("C-small-attempt0.out");
        BufferedReader in = new BufferedReader(inputReader);
        BufferedWriter out = new BufferedWriter(outputWriter);
        String numStr = in.readLine();
        int n = Integer.parseInt(numStr);
        for (int i = 0; i < n; i++) {
            String line = in.readLine();
            String[] strs = line.split("\\s");
            int a = Integer.valueOf(strs[0]);
            int b = Integer.valueOf(strs[1]);
            out.write("Case #" + (i+1) + ": " + count(a, b) + "\n");
        }
        in.close();
        out.close();

        assert count(1, 9) == 0;
        assert count(10, 40) == 3;
        assert count(100, 500) == 156;
        assert count(1111, 2222) == 287;
    }

    private static int count(int a, int b) {
        int length = Integer.toString(a).length();

        Set<Long> pairs = new HashSet<>();
        for (int x = a; x < b; x++) {
            for (int n = 1; n < length; n++) {
                int r = rotate(x, n);
                if (r > x && r <= b) {
                    pairs.add((long) (x * 3000000 + r));
                }
            }
        }
        return pairs.size();
    }

    private static int rotate(int a, int n) {
        String number = Integer.toString(a);
        String head = number.substring(0, n);
        String tail = number.substring(n);
        return Integer.parseInt(tail + head);
    }
}
