Description

Due to the recent popularity of number games in the science association, someone has named a new type of modulo number. These numbers must satisfy the condition that the sum of their digits modulo $N$ equals $0$. Now, everyone is playing a new game: given a closed integer interval $[a, b]$, determine how many such modulo numbers exist within this interval.

Input Format

There are multiple test cases in the input. Each case consists of three numbers: $a$, $b$, and $N$.

Output Format

For each test case, output a single line indicating the count of numbers whose digit sum modulo $N$ equals $0$.

Sample 1

1 19 9

2

Data Range and Hint

For all test cases, $1\le a,b\le 2^{31}-1$ and $1\le N\lt 100$.