/*
 * 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 com.eevoskos.codejam;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	
	private static final boolean DEBUG = false;
	
	public static void main(String... args) {
		RecycledNumbers instance = new RecycledNumbers();
		
		try {
			BufferedReader c = new BufferedReader(new InputStreamReader(System.in));

			// Number of test cases
			int T = Integer.valueOf(c.readLine());

			System.out.println();

			// Do, for each test case
			for (int i = 0; i < T; i++) {

				// Read input string
				String input = c.readLine();

				// Process input
				String output = instance.solveCase(input);

				// Print the translated text
				System.out.println("Case #" + (i + 1) + ": " + output);

			}

		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	Set<Pair> allPairs = new HashSet<Pair>();
	Set<Pair> countPairs = new HashSet<Pair>();

	private String solveCase(String input) {
		// Init variables
		countPairs = new HashSet<Pair>();
		
		String[] split = input.split(" ");
		int A = Integer.valueOf(split[0]);
		int B = Integer.valueOf(split[1]);		
		return getTotalRecycledPairs(A, B);
	}

	private String getTotalRecycledPairs(int a, int b) {
		int numOfPairs = 0;
		for (int i = a; i <= b; i++) {
			numOfPairs += countRecycledPairs(i, a, b);
		}		
		return String.valueOf(numOfPairs);
	}

	private int countRecycledPairs(int num, int a, int b) {
		int count = 0;
		Set<Pair> pairs = getAllPairs(num);
		for (Pair p : pairs) {
			if (p.isIncludedIn(a, b) && p.isRecycled()) {
				if (!countPairs.contains(p)) {
					countPairs.add(p);
					count++;
					if (DEBUG) {
						System.out.println(p + ": counts!");
					}
				} else {
					if (DEBUG) {
						System.out.println(p + ": already count");
					}
				}
			} else {
				if (DEBUG) {
					System.out.println(p + ": does not count");
				}
			}
		}
		return count;
	}
	
	private Set<Pair> getAllPairs(int num) {
		HashSet<Pair> pairs = new HashSet<Pair>();
		String s = String.valueOf(num);
		for (int i = 0; i < s.length(); i++) {
			String s1 = s.substring(0, i);
			String s2 = s.substring(i);
			pairs.add(new Pair(Integer.valueOf(s1 + s2), Integer.valueOf(s2 + s1)));
		}
		return pairs;
	}

	class Pair {
		int n, m;
		
		Pair(int n, int m) {
			this.n = Math.min(n, m);
			this.m = Math.max(n, m);
		}
		
		@Override
		public String toString() {
			return "(" + n + ", " + m + ")";
		}
		
		boolean isRecycled() {
			String N = String.valueOf(n);
			String M = String.valueOf(m);
			
			if (N.length() != M.length()) {
				return false;
			}
			
			for (int i = 0; i < N.length(); i++) {
				String n1 = N.substring(0, i);
				String n2 = N.substring(i);
				if ((n2 + n1).matches(M)) {
					return true;
				}
			}
			
			return false;
		}
		
		boolean isIncludedIn(int a, int b) {
			return a <= n && n < m && m <= b;
		}
		
		@Override
		public boolean equals(Object another) {
			if (another == null)
				return false;

			if (!(another instanceof Pair))
				return false;

			return (this.m == ((Pair) another).m && this.n == ((Pair) another).n)
					|| (this.m == ((Pair) another).n && this.n == ((Pair) another).m);
		}
		
		@Override
		public int hashCode() {
			return String.valueOf(n).hashCode() + String.valueOf(m).hashCode();
		}
	}

}
