import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class ReadFile {
	public static void main(String[] args) throws Exception {
		String srcFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt1.in.txt";
		String destFile = "C:" + File.separator + "Documents and Settings"
				+ File.separator + "rohit" + File.separator + "My Documents"
				+ File.separator + "Downloads" + File.separator
				+ "C-small-attempt0.out";
		File file = new File(srcFile);
		List<String> readData = new ArrayList<String>();
		FileReader fileInputStream = new FileReader(file);
		BufferedReader bufferedReader = new BufferedReader(fileInputStream);
		StringBuilder stringBuilder = new StringBuilder();
		String line = null;
		while ((line = bufferedReader.readLine()) != null) {
			readData.add(line);
		}
		stringBuilder.append(generateOutput(readData));
		File writeFile = new File(destFile);
		if (!writeFile.exists()) {
			writeFile.createNewFile();
		}
		FileWriter fileWriter = new FileWriter(writeFile);
		BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
		bufferedWriter.write(stringBuilder.toString());
		bufferedWriter.close();
		System.out.println("output" + stringBuilder);
	}

	/**
	 * @param number
	 * @return
	 */
	private static String generateOutput(List<String> number) {
		StringBuilder stringBuilder = new StringBuilder();
		for (int i = 0; i < number.size(); i++) {
			if (i == 0) {
				continue;
			} else {
				String tempString = number.get(i);
				String[] temArr = tempString.split(" ");
				stringBuilder.append("Case #" + i + ": ");
				stringBuilder.append(getRecNumbers(temArr[0], temArr[1]));
				stringBuilder.append("\n");
			}
		}
		if (stringBuilder.length() > 0) {
			stringBuilder.deleteCharAt(stringBuilder.length() - 1);
		}
		return stringBuilder.toString();
	}

	// /* This method accepts method for google code jam */
	// private static String method(String value) {
	// int intValue = Integer.valueOf(value);
	// double givenExpr = 3 + Math.sqrt(5);
	// double num = Math.pow(givenExpr, intValue);
	// String valArr[] = (num + "").split("\\.");
	// int finalVal = Integer.valueOf(valArr[0]) % 1000;
	//
	// return String.format("%1$03d", finalVal);
	//
	// }
	//
	// /* This method accepts method for google code jam */
	// private static String method2(String value) {
	// StringTokenizer st = new StringTokenizer(value, " ");
	// String test[] = value.split(" ");
	// StringBuffer str = new StringBuffer();
	//
	// for (int i = 0; i < test.length; i++) {
	// // test[i]=test[test.length-i-1];
	// str.append(test[test.length - i - 1]);
	// str.append(" ");
	// }
	// str.deleteCharAt(str.length() - 1);
	// String strReversedLine = "";
	//
	// while (st.hasMoreTokens()) {
	// strReversedLine = st.nextToken() + " " + strReversedLine;
	// }
	//
	// return str.toString();
	// }

	private static int getRecNumbers(String no1, String no2) {

		int a = Integer.valueOf(no1);
		int b = Integer.valueOf(no2);
		Set<String> dupC = new HashSet<String>();
		for (int i = a; i <= b; i++) {
			int n = i;
			List<String> value = findPerm(n);
			for (String val : value) {
				if (Integer.valueOf(val) <= b && Integer.valueOf(val) >= a
						&& n < Integer.valueOf(val)) {
					dupC.add(n + "-" + val);
				}
			}
		}
		return dupC.size();
	}

	private static List<String> findPerm(int num) {
		String numString = String.valueOf(num);
		List<String> value = new ArrayList<String>();
		for (int i = 0; i < numString.length(); i++) {
			String temp = charIns(numString, i);
			if (!temp.equalsIgnoreCase(numString)) {
				value.add(charIns(numString, i));
			}
		}
		return value;

	}

	public static String charIns(String str, int j) {
		String begin = str.substring(0, j);
		String end = str.substring(j);
		return end + begin;
	}
}
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.*;

public class MBHappy extends JamProblem {


    Map<Integer, Integer> baseMap;
    Map<Long, Integer> minMap = new HashMap<>();
    int ile = 0;

    void prepare() {

        SetUtil.cycleSubsets(bases.size(), new SetUtil.SubsetCallBack() {
            @Override
            public void run(long subset, int size) {
                clearCache();
                System.out.println(minMap.size());
                if (size == 0) {
                    return;
                }
                List<Integer> list = SetUtil.getList(subset, bases.size());
                List<Integer> bas = ArrayUtil.fromIndexList(list, bases);
                long forList = SetUtil.getForList(baseMap, bas);
                int max = 2;
                for (int j = 0; j < bases.size(); j++) {
                    long without = subset ^ SetUtil.getOne(j);
                    Integer withMin = minMap.get(without);
                    if (withMin != null) {
                        max = Math.max(max, withMin);
                    }
                }
                int num = max;
                while (true) {
                    int tested = 0;
                    for (Integer base : bas) {
                        System.out.println("" + ca + "\t" + base + "\t" + num);
                        if (!isHappy(num, base)) {
                            break;
                        }
                        tested++;
                    }
                    if (tested == bas.size()) {
                        ca++;
                        minMap.put(subset, num);
                        return;
                    }
                    if (cache.size() > 100000) {
                        clearCache();
                    }
                    num++;
                }
            }

        });
    }

    private void clearCache() {
        cache.clear();
        for (Integer base : bases) {
            cache.put(new MBAddr(1, base), Happy.HAPPY);
        }
    }

    public MBHappy() {
        for (int i = 2; i <= 10; i++) {
            bases.add(i);
        }
        baseMap = ArrayUtil.listToMap(bases);
    }

    Map<MBAddr, Happy> cache = new HashMap<>();

    List<Integer> bases = new ArrayList<>();

    public static void main(String[] args) throws IOException {
        MBHappy h = new MBHappy();
        h.prepare();
        h.go();
    }

    boolean isHappy(int num, int base) {
        MBAddr addr1 = new MBAddr(num, base);
        Happy isHappy = cache.get(addr1);
        if (isHappy != null) {
            if (isHappy == Happy.HAPPY) {
                return true;
            }

            if (isHappy == Happy.UNHAPPY) {
                return false;
            }
        }

        List<Integer> integers = MathUtil.convertToBase(num, base);
        int sum = MathUtil.sumSquaredList(integers);

        isHappy = cache.get(new MBAddr(sum, base));
        if (isHappy != null) {
            if (isHappy == Happy.HAPPY) {
                cache.put(addr1, Happy.HAPPY);
                return true;
            }

            if (isHappy == Happy.UNHAPPY) {
                cache.put(addr1, Happy.UNHAPPY);
                return false;
            }

            if (isHappy == Happy.UNKNOWN) {
                cache.put(addr1, Happy.UNHAPPY);
                return false;
            }
        }
        cache.put(addr1, Happy.UNKNOWN);
        boolean happy = isHappy(sum, base);
        if (happy) {
            cache.put(addr1, Happy.HAPPY);
            return true;
        } else {
            cache.put(addr1, Happy.UNHAPPY);
            return false;
        }

    }

    int ca = 0;

    @Override
    String solveCase(JamCase jamCase) {
        int num = 2;
        MBHCase cas = (MBHCase) jamCase;

        return "" + minMap.get(SetUtil.getForList(baseMap, cas.bases));
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        MBHCase cas = new MBHCase();
        cas.lineCount = 1;
        cas.bases = JamUtil.parseIntList(file.get(line));
        return cas;
    }
}

class MBHCase extends JamCase {
    List<Integer> bases;
}

class MBAddr {
    int number;
    int base;

    MBAddr(int number, int base) {
        this.number = number;
        this.base = base;
    }

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

        MBAddr mbAddr = (MBAddr) o;

        if (base != mbAddr.base) return false;
        if (number != mbAddr.number) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = number;
        result = 31 * result + base;
        return result;
    }
}

class MBNum {
    int number;
    int base;
    boolean isHappy;

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

        MBNum mbNum = (MBNum) o;

        if (base != mbNum.base) return false;
        if (isHappy != mbNum.isHappy) return false;
        if (number != mbNum.number) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = number;
        result = 31 * result + base;
        result = 31 * result + (isHappy ? 1 : 0);
        return result;
    }
}

enum Happy {
    HAPPY, UNHAPPY, UNKNOWN;
}


