Problem: You have been given 3 integers l, r and k. Find how many numbers between l and r (both inclusive) are divisible by k. You do not need to print these numbers, you just have to find their count.  

Input Format
The first and only line of input contains 3 space separated integers l, r and k. 

Output Format
Print the required answer on a single line.  

Constraints
 1 ≤ l ≤ r ≤ 1000  
 1 ≤ k ≤ 1000     

SAMPLE INPUT
1 10 1

SAMPLE OUTPUT
10

Solution (in PYTHON):

Solution:
def get_count_divisors(input_arr):
	count = 0
	for num in range(int(input_arr[0]), int(input_arr[1]) + 1):
		if (num % int(input_arr[2]) == 0):
			count += 1
	return count
input_num = raw_input()
input_num_arr = input_num.split(' ')
print get_count_divisors(input_num_arr)