This problem is as simple as short. Just find how many numbers from A to B with sum of digits from X to Y are divisible by K.

Input
The first line contains 5 space-separated positive integers: A, B, X, Y, K

Output
Output one number - answer for the question.

Constraints

• 0 < A, B, K ≤ 10¹³
• 0 < X, Y ≤ 1000
• A ≤ B
• 0 < A, B, ≤ 10⁷ in 32 % of the test data