1568 Childless Number


Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 32M

Problem types
Allowed languages
C, C++, Java, Python

Description

Let D(X) denote the sum of digits of the positive integer X. For example, D(4007) = 4 + 0 + 0 + 7 = 11.

Take any positive integer X, and let Y = X / D(X). If Y is an integer, we say that Y is the parent of X (and that X is a child of Y). For example, if X=12 then X / D(X) = 12 / (1+2) = 4, hence 4 is the parent of 12.

Note that multiple numbers can have the same parent. For example, 4 is also the parent of 36, as 36/(3+6) = 36/9 = 4.

We say that a number Y is childless if there is no positive integer X such that Y is the parent of X.

You are given two ints A and B. Find the count of all childless numbers that lie between A and B, inclusive.

Input

Several Test case Every case contain two integer A and B. A will be between 1 and 1,000,000,000, inclusive. B will be between A and 1,000,000,000, inclusive. B-A will be between 0 and 10,000, inclusive.

Output

The number of all childless numbers that lie between A and B

Sample

Input

4 7
61 65

Output

0
3

Source: zjut_DD


Comments

There are no comments at the moment.