/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.Writer;
import java.util.ArrayList;
import java.util.HashSet;


public class q3 {
	
	
	
	public static void main(String args[]) throws Exception {
		String path = "./src/";
		String ifile = path + "C-small-attempt0.in";
		String ofile = path + "C-small-attempt0.out";
		int i = 0, j = 0;
	

		BufferedReader in = new BufferedReader(new FileReader(ifile));
		StringBuilder os = new StringBuilder();
		
		
		String line = null;
		int ln = 0;
		
		in.readLine();
		while ((line = in.readLine()) != null) {
			String vs[] = line.split(" ");
			
			++ln;
			

			
			os.append(String.format("Case #%d: %d", ln, rnum(Long.parseLong(vs[0]), 
					Long.parseLong(vs[1]))));
			os.append('\n');
		}
		
		in.close();
		
		
		Writer out = new BufferedWriter(new FileWriter(ofile));
		out.write(os.toString());
		out.close();
	}
	
	static long rnum(long min, long max) {
		long c = 0, i = 0;
		int j = 0, k = 0;
		
		for (i = min; i <= max; ++i) {
			int length = (int)Math.log10(i) + 1;
			int num[] = new int[length];
			
			
			long t = i;
			j = 0;
			while (t > 0) {
				num[j++] = (int)t%10;
				t = t / 10;
			}
			
			
			int first = num.length - 1;

			HashSet<Long> s = new HashSet<Long>();
			
			for (j = first - 1; j >= 0; --j) {
				if (num[j] >= num[first]) {
					int temp = j;
					long nr = 0;
					for (k = length - 1; k >= 0; --k) {
						nr += num[temp--] * (Math.pow(10,k));
						if (temp == -1)
							temp = first;
					}
					

					if (nr > i && nr > min && nr <= max && !s.contains(new Long(nr))) {
						c++;
						s.add(new Long(nr));
					}
				}
			}
			
		}
		
		return c;
	}

	


}

