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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
package qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;

import common.FileTranslatorBasis;

public class C {

	final static int[] digitNum = { 9, 99, 999, 9999, 99999, 999999, 9999999 };
	int low;
	int high;

	int pow = 1;

	public C(String low, String high) {

		for (int i = 0; i < low.length() - 1; i++) {
			pow = 10 * pow;
		}
		this.low = Integer.parseInt(low);
		this.high = Integer.parseInt(high);
	}

	long count;
	int[] map = new int[2000001];

	public void initMap() {
		int[] tmp = { 1, 11, 111, 1111, 11111, 111111, 1111111, 2, 22, 222,
				2222, 22222, 222222, 3, 33, 333, 3333, 33333, 333333, 4, 44,
				444, 4444, 44444, 444444, 5, 55, 555, 5555, 55555, 555555, 6,
				66, 666, 6666, 66666, 666666, 7, 77, 777, 7777, 77777, 777777,
				8, 88, 888, 8888, 88888, 888888, 9, 99, 999, 9999, 99999,
				999999, };
		for (int i : tmp) {
			map[i] = -1;
		}
	}

	/**
	 * 
	 * @param in
	 */
	private void parse(int in) {
		int pair = 1;

		if (map[in] == -1) {
			return;
		}
		map[in]=-1;
		String inStr = String.valueOf(in);
		char[] chars = inStr.toCharArray();
		for (int i = 0; i < chars.length - 1; i++) {
			in = (in - (chars[i] - 48) * pow) * 10 + (chars[i] - 48);
			if (valid(in)) {
				if (map[in] != -1) {
					pair++;
					map[in] = -1;
				}
			}
		}
		count += pair * (pair - 1) / 2;
	}

	public long count() {
		for (int i = low; i <= high; i++) {
			parse(i);
		}
		return count;
	}

	private boolean valid(int t) {
		return t >= low && t <= high;
	}

	public static void main(String[] args) throws FileNotFoundException {

		System.setOut(new PrintStream(new File("output.txt")));

//		String fname = "sample.txt";
//		String fname = "C-small-attempt0.in.txt";
		String fname = "C-large.in.txt";
		FileTranslatorBasis ftb = FileTranslatorBasis.getInstance(fname);

		int num = ftb.getNumOfCase();
		for (int i = 0; i < num; i++) {
			String[] input = ftb.getStrDataArray();
			C c = new C(input[0],input[1]);
			System.out.println("Case #" + Integer.toString(i + 1) + ": "
					+ String.valueOf(c.count()));

		}

	
	}
}
