A. Arithmetica's problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the land of Arithmetica, the wise mathematician Numeron is known for solving intricate numerical puzzles. One day, Numeron encounters a problem involving a range of numbers and a special integer $$$K$$$. The challenge is to determine how many numbers within a given range are multiples of $$$K$$$. Your task is to help Numeron by calculating the number of multiples of $$$K$$$ within the interval $$$[L, R]$$$.

Input

The first line contains three integers $$$L$$$, $$$R$$$, and $$$K$$$ ($$$1 \leq L \leq R \leq 1000$$$, $$$1 \leq K \leq 1000$$$), representing the start and end of the interval and the special integer, respectively.

Output

Output a single integer representing the count of numbers within the interval $$$[L, R]$$$ that are multiples of $$$K$$$.

Examples
Input
1 10 2
Output
5
Input
1 10 3
Output
3
Input
13 27 5
Output
3