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

import base.Base;

import java.io.PrintStream;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Created with IntelliJ IDEA.
 * User: babulya
 * Date: 14.04.12
 * Time: 19:45
 * To change this template use File | Settings | File Templates.
 */
public class C extends Base {
    private static class Number {
        private int[] digits;

        private Number(int[] digits) {
            this.digits = digits;
        }

        public Number(int N) {
            int dc = (int) Math.ceil(Math.log10(N + 1));
            digits = new int[dc];
            for (int i = 0; i < dc; i++) {
                digits[i] = N % 10;
                N = N / 10;
            }
        }

        private static int compareTo(int o1, int o2) {
            return o1 - o2;
        }

        public int compareTo(Number other) {
            int res = compareTo(digits.length, other.digits.length);
            if (res != 0) return res;
            int ind = digits.length - 1;
            while (ind >= 0 && digits[ind] == other.digits[ind]) {
                ind--;
            }
            if (ind >= 0) return compareTo(digits[ind], other.digits[ind]);
            return 0;
        }

        public Set<Number> pairs() {
            Set<Number> res = new HashSet<Number>();
            for (int i = 0; i < digits.length - 1; i++) {
                int[] newdigits = new int[digits.length];
                for (int j = 0; j <= i; j++) {
                    newdigits[j + digits.length - i - 1] = digits[j];
                }
                for (int j = i + 1; j < digits.length; j++) {
                    newdigits[j - i - 1] = digits[j];
                }
                res.add(new Number(newdigits));
            }
            return res;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Number number = (Number) o;

            if (!Arrays.equals(digits, number.digits)) return false;

            return true;
        }

        @Override
        public int hashCode() {
            return digits != null ? Arrays.hashCode(digits) : 0;
        }

        public String toString() {
            StringBuilder sb = new StringBuilder();
            for (int i = digits.length - 1; i >= 0; i--) {
                sb.append(digits[i]);
            }
            return sb.toString();
        }
    }

    private static int solve(int a, int b) {
        int result = 0;
        Number A = new Number(a);
        Number B = new Number(b);
        for (int n = a; n <= b; n++) {
            Number N = new Number(n);
            for (Number M : N.pairs()) {
                if (A.compareTo(N) <= 0 && N.compareTo(M) < 0 && M.compareTo(B) <= 0) {
                    result++;
                }
            }
        }
        return result;
    }

    @Override
    protected void solve(Scanner in, PrintStream out) {
        int T = in.nextInt();
        for (int i = 1; i <= T; i++) {
            int A = in.nextInt();
            int B = in.nextInt();
            out.println(String.format("Case #%d: %d", i, solve(A, B)));
        }
    }

    public static void main(String[] args) {
        long now = System.currentTimeMillis();
        new C();
        System.out.println((System.currentTimeMillis() - now)/1000);
    }
}
