The dig\(it-pr\)oduct of a positive integer is the product of the number's decimal digits. For example, the
dig\(it-pr\)oduct of 2612 is \(2 \cdot 6 \cdot 1 \cdot 2 = 24\).
The se\(lf-pr\)oduct of a number is the product of the number and its dig\(it-pr\)oduct. For example, the
se\(lf-pr\)oduct of 2612 is \(2612 \cdot 24 = 62688\).
Write a program that, given two positive integers A and B, calculates the number of positive integers
whose se\(lf-pr\)oduct is between A and B, inclusive.
In test cases worth a total of 25 points, A and B will be at most \(10^{8}\).
In test cases worth another 15, A and B will be at most \(10^{12}\).
The first and only line contains two integers A and B (\(1 \le A \le B < 10^{18}\)).
Output should consist of a single integer, the number of positive integers whose twist is between
A and B.
20 302145 19242224222 22242221Clarification of second example. The self-products of numbers 19, 24, 32 i 41 are in order 171, 192,
192 and 164.