Problem:
 Score : 100 points    Problem Statement How many multiples of d are there among the integers between L and R (inclusive)?      Constraints  All values in input are integers.  1 \leq L \leq R \leq 100  1 \leq d \leq 100         Input Input is given from Standard Input in the following format:  L  R  d       Output Print the number of multiples of d among the integers between L and R (inclusive).        Sample Input 1 5 10 2      Sample Output 1 3   Among the integers between 5 and 10 , there are three multiples of 2 : 6 , 8 , and 10 .        Sample Input 2 6 20 7      Sample Output 2 2   Among the integers between 6 and 20 , there are two multiples of 7 : 7 and 14 .        Sample Input 3 1 100 1      Sample Output 3 100

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''


 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





l,r,d=mii()
ans=0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)

Solution (Python):
L, R, d = map(int, input().split())
ans = 0
for i in range(L, R+1):
  if i%d == 0:
    ans += 1
print(ans)

Solution (Python):
L, R, d = map(int,input().split())

ans = []

for i in range(L, R + 1):
  if i % d == 0:
    ans.append(i)

print(len(ans))

Solution (Python):
m,n,d=map(int,input().split())
c=0
for i in range(m,n+1):

	if i%d==0:
		c+=1
		
print(c)

Solution (Python):
l, r, d = map(int, input().split())
answer = 0
for i in range(l, r + 1):
    if i % d == 0:
        answer += 1
print(answer)

Solution (Python):
l,r,d=map(int,input().split())
cnt=0
for i in range(l,r+1):
    if i%d==0:
        cnt+=1
print(cnt)

Solution (Python):
l,r,d=map(int, input().split())

cnt = 0
tmp = 0

while tmp <= r:
    tmp = tmp + d
    if tmp >= l and tmp <= r:
        cnt+=1

print(cnt)

Solution (Python):
l,r,d=map(int,input().split())
cnt=0

for i in range(l,r+1):
    if i%d==0:
        cnt+=1

print(cnt)

Solution (Python):
l, r, d = map(int, input().split())

cnt = 0
tmp = d
while tmp <= r:
    if tmp <= r and tmp >= l:
        cnt += 1
    tmp += d
print(cnt)

Solution (Python):
def solve(L,R,d):
    count = 0
    for i in range(L,R+1):
        if i % d == 0:
            count += 1
    return count
L, R, d = map(int, input().split())
print(solve(L,R,d))

Solution (Python):
stir=input()
lst=stir.split(" ")
l=int(lst[0])
r=int(lst[1])
t=lst[2]
b=1
x=0
multiples=[]
while(b<101):
    multiples.append(int(t)*b)
    b+=1
for a in range(l, r+1):
    for m in multiples:
        if(m==a):
            x+=1
print(x)

Solution (Python):
a,b,c=map(int,input().split())
d=0
for i in range(a,b+1):
  if i%c==0:
    d+=1
print(d)

Solution (Python):
L,R,d = map(int,input().split())

print(R//d - (L-1)//d)

Solution (Python):
a,b,c=map(int,input().split())
num=0
for i in range(a,b+1):
  if i%c == 0:
    num+=1
print(num)

Solution (Python):
din = map(int, raw_input().split())
print ((din[1])/din[2] - (din[0]-1)/din[2])

Solution (Python):
inp = input().split(" ")
count = 0
for x in range(int(inp[0]),int(inp[1])+1):
    if x % int(inp[2]) == 0:
        count = count+1
print(count)

Solution (Python):
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

l,r,d = NextInts()

ans = 0
for i in range(l,r+1):
    if i%d == 0:
        ans += 1
print(ans)

Solution (Python):
def get_ints():
	return map(int, input().split())
def get_list():
	return list(map(int, input().split()))

l, r, d = get_ints()
c = 0
for i in range(l, r + 1):
	if i % d == 0:
		c += 1
print(c)

Solution (Python):
L,R,d=map(int,input().split())
a=L//d
if L%d==0:
    a-=1
b=R//d
print(b-a)

Solution (Python):
li = list(map(int, input().split()))
result = int(li[1]/li[2]) - int(li[0]/li[2])
if li[0] % li[2] == 0:
    result += 1
print(result)

Solution (Python):
L, R, d = map(int, input().split(" "))

a = R // d
b = (L-1) // d
print(a-b)

Solution (Python):
read = lambda: list(map(int, input().split()))
l, r, d = read()
ans = 0
for i in range(l, r + 1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r + 1):
	if i % d == 0:
		ans += 1
print(ans)

Solution (Python):
L,R,d=map(int,input().split())

count=0
for i in range(L,R+1):
    if i%d==0:
        count+=1
print(count)

Solution (Python):



L, R, d = map(int, input().split())


count = 0


for i in range(L, R+1):
    if i%d==0:
        count += 1


print(count)

Solution (Python):
l, r, d = map(int, input().split())

count = 0
for i in range(l, r + 1):
  if i % d == 0:
    count += 1
print(count)

Solution (Python):
l, r, d = map(int,input().rstrip("\n").split(" "))
 
answer = (r // d) - ((l-1) // d)
 
print(answer)

Solution (Python):
m,n,p = map(int, input().split())
l=[]
for i in range(m,n+1):
    if i % p == 0:
        l.append(i)
print(len(l))

Solution (Python):
l,r,d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
A,B,C = map(int,input().split())
num_list = []
for i in range(A,B+1):
  if i % C == 0:
    num_list.append(i)

print(len(num_list))

Solution (Python):
l, r, x = map(int, input().split(' '))

ans = r // x - (l-1) // x
print(ans)

Solution (Python):
l,r,d=[int(x) for x in input().split()]
x=(r-l)//d	
if l%d==0 or r%d==0:
	x+=1

print(x)

Solution (Python):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R + 1):
    if i % d == 0:
        count = count + 1

print(count)

Solution (Python):
def main():
    L, R, d = map(int,input().split())

    if L%d==0 and R%d==0:
        print(int((R-L)/d) + 1)
        return
    else:
        l = L - L % d
        r = R - R % d
        print(int((r - l)/d))
        return
    
if __name__=='__main__':
    main()

Solution (Python):
L, R, d = map(int, input().split())

ans = 0
for x in range(L, R+1):
  if x%d == 0:
    ans += 1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
L, R, d = list(map(int, input().split()))

res = 0

for i in range(L, R+1):
    if i % d == 0:
        res += 1
print(res)

Solution (Python):
a,b,c=map(int,input().split())
cnt=0
for x in range(a,b+1):
	if x%c==0:
		cnt+=1   
print(cnt)

Solution (Python):
L,R,d = map(int,input().split())

left = (L-1)//d
right = R//d
ans = right-left
print(ans)

Solution (Python):
import math
L,R,d = map(int, input().split())

minumum = math.ceil(L/d)
maximum = R//d

if maximum - minumum >=0:
    print(maximum - minumum+1)
else:
    print(0)

Solution (Python):
l,r,d = map(int, input().split())
var=l//d
var1=r//d
ans=var1-var
if l%d==0:
    ans+=1
print(ans)

Solution (Python):
ent, saida, mul= map(int, input().split())
multiplos=[]
for x in range(ent, saida+1):
    if x%mul==0:
        multiplos.append(x)
print(len(multiplos))

Solution (Python):
a = input()
b, c, d = [int(x) for x in a.split()]
x = [x for x in range(b, c + 1) if x % d == 0]
print(len(x))

Solution (Python):
L,R,d = list(map(int,input().split()))
ans = 0
for i in range(L,R+1):
    if i%d == 0:
        ans += 1
print(ans)

Solution (Python):
l,r,d=map(int,input().split())
c=0
for x in range(l,r+1):
  if x%d==0:
    c=c+1
print(c)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d-(l-1)//d)

Solution (Python):
l,r,d = [int(x) for x in input().split()]
nums = [int(x) for x in range(l,r+1)]
ans = []

for i in range(len(nums)):
      if nums[i]%d == 0:
            ans.append(nums[i])

print(len(ans))

Solution (Python):
a,b,c = map(int,input().split())
ans = 0

for i in range(a,b+1):
    if i % c == 0:
        ans +=1
    else:
        pass
print(ans)

Solution (Python):
l,r,d=map(int, input().split()) 

ans=0
for i in range(l,r+1):
  if i%d==0:
    ans+=1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d-(l-1)//d)

Solution (Python):
l,r,d=map(int,input().split())
counter=0
for i in range(l,r+1):
    if(i%d==0):
        counter+=1

print(counter)

Solution (Python):
import sys
L,R,d = map(int, sys.stdin.readline().split())



result = 0
for index in range(L,R+1):
    if index % d == 0:
        result += 1
        
print(result)

Solution (Python):
it = lambda: list(map(int, input().strip().split()))


def solve():
    L, R, d = it()

    cnt = 0
    for i in range(L, R + 1):
        if i % d == 0:
            cnt += 1
    print(cnt)


solve()

Solution (Python):
from sys import stdin,stdout                           
import math                                            
import heapq                                           
                                                       
t = 1                                                  
def aint():                                            
	return int(input().strip())                        
def lint():                                            
	return list(map(int,input().split()))              
def fint():                                            
	return list(map(int,stdin.readline().split()))     
                                                       


def main():
	l,r,d=lint()
	print(r//d-(l-1)//d)
	
	return




for i in range(t):                                     
	
	main()

Solution (Python):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)

Solution (Python):
S = input().split()

counter = 0
for _ in range (int(S[0]),int(S[1])+1):
  if _ % int(S[2]) == 0:
    counter += 1
  
print(counter)

Solution (Python):
S = input().split()

counter = 0
for _ in range (int(S[0]),int(S[1])+1):
  if _ % int(S[2]) == 0:
    counter += 1
  
print(counter)

Solution (Python):
l, r, d = [int(x) for x in input().split()]
print(r // d - (l - 1) // d)

Solution (Python):
L, R, d = map(int, input().split())

if L%d == 0 or R%d == 0 :
    print((R-L)//d + 1)
else:
    print((R - L)//d)

Solution (Python):
l,r,d=map(int,input().split())
L=l//d
R=r//d
if l%d==0:
    print(R-L+1)
else:
    print(R-L)

Solution (Python):
l , r , d = map(int, input().split())
count = 0
for i in range(l , r + 1):
  if i % d == 0:
    count += 1
print(count)

Solution (Python):
import sys,math,collections
from collections import defaultdict


	
def file():
	sys.stdin = open('input.py', 'r')
	sys.stdout = open('output.py', 'w') 
def get_array():
	l=list(map(int, input().split()))
	return l
def get_2_ints():	
	a,b=map(int, input().split())
	return a,b
def get_3_ints():	
	a,b,c=map(int, input().split())
	return a,b,c	
def sod(n):
	n,c=str(n),0
	for i in n:	
		c+=int(i)
	return c	

def getFloor(A, x):

	(left, right) = (0, len(A) - 1)

	floor = -1
	while left <= right:
		mid = (left + right) // 2
		if A[mid] == x:
			return A[mid]
		elif x < A[mid]:
			right = mid - 1
		else:
			floor = A[mid]
			left = mid + 1
			
	return floor

def main():
	l,r,n=get_3_ints()
	c=0
	for i in range(min(l,r),max(l,r)+1):
		
		if(i%n==0):
			c+=1
	print(c)		


                       

















				

			







            
			
































		








if __name__ == '__main__':
    main()

Solution (Python):
l,r, d = map(int, input().split())
ans = r // d
ans -= (l-1) // d
print(ans)

Solution (Python):
L, R, d = map(int, input().split())

print((R // d) - ((L-1) //d))

Solution (Python):
L, R, d = map(int, input().split())

ans = 0
for i in range(L, R+1):
    if i % d == 0:
        ans += 1

print(ans)

Solution (Python):


l, r, d = map(int,input().split())

print(r//d-(l-1)//d)

Solution (Python):
baseData = [int(i) for i in input().split(" ")]
L = baseData[0]
R = baseData[1]
d = baseData[2]

cnt = 0

for i in range(L,R + 1):
  if i % d == 0:
    cnt += 1

print(cnt)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r + 1, 1):
    if i % d == 0: ans += 1
print(ans)

Solution (Python):
def main():
    
    input_lines_lrd = input()
    arrLRD = input_lines_lrd.split(" ")
    l = int(arrLRD[0])
    r = int(arrLRD[1])
    d = int(arrLRD[2])
    
    cnt = 0
    for n in range(l, r+1):
        if n % d == 0:
            cnt = cnt + 1
    
    print(cnt)
    
if __name__ == "__main__":
    main()

Solution (Python):
L,R,d = map(int,input().split())
i=0
for x in range (L,R+1):
    if x%d==0:
        i+=1
print(i)

Solution (Python):
l,r,d=map(int,input().split())
ct=0
for i in range(l,r+1):
  if i%d==0:
    ct += 1
print(ct)

Solution (Python):
l,r,n=map(int,input().split())
a=(r//n)-(l//n if l!=n else 0)
if l!=r:print(a)
else: print(1)

Solution (Python):
the_string = input()
L1,R1,d1 = the_string.split()
L=int(L1)
R=int(R1)
d=int(d1)
count=0
for i in range(L,R+1):
    if(i%d)==0:
        count+=1
print(count)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
L, R, d = map(int, input().split())

count = 0

for i in range(101):
  if d * i >= L and d * i <= R:
    count += 1
  if d * i > R:
    break
    
print(count)

Solution (Python):
l,r,d=map(int, input().split())

ans=r//d-(l-1)//d
print(ans)

Solution (Python):
l, r, d = map(int, input().split())

def count(x):
    return x // d

print(count(r) - count(l-1))

Solution (Python):
l,r,d = map(int,input().split())
ans = 0
for i in range(l,r+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
import sys

DEBUG=False
if DEBUG:
    f=open("202007_2nd/A_input.txt")
else:
    f=sys.stdin
l,h,d=map(int,f.readline().split())
ans=0
for _ in range(l,h+1):
    ans=ans+1 if _%d==0 else ans
print(ans)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
l,r,d = [int(x) for x in input().split()]
C = 0
for i in range(l, r+1):
    if i % d == 0:
        C += 1
 
print(C)

Solution (Python):
A = list(map(int, input().split()))
C = 0
for i in range(A[0], A[1]+1):
    if i % A[2] == 0:
        C += 1
 
print(C)

Solution (Python):
digitsArr = list(map(int, input().split()))
multipleConter = 0
for i in range(digitsArr[0], digitsArr[1]+1):
    if i % digitsArr[-1] == 0:
        multipleConter += 1

print(multipleConter)

Solution (Python):
l,r,d = list(map(int,input().split()))
ans = r//d - (l-1)//d
print(ans)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    l, r, d = map(int, readline().split())

    ans = 0

    for i in range(l, r + 1):
        if i % d == 0:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x, y, z = map(int, input().split())
t = 0
for i in range(x,y+1,1):
  if i % z == 0:
    t += 1
print(t)

Solution (Python):
L,R,d = map(int,input().split())

r = R//d
l = (L-1)//d

print(r-l)

Solution (Python):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    l,r,d = LI()

    return r // d - (l-1) // d


print(main())

Solution (Python):
L, R, d = map(int, input().split())

print(sum(i % d == 0 for i in range(L, R + 1)))

Solution (Python):
c=0
a,b,d=map(int,input().split())
for i in range(a,b+1):
  if i%d==0: c+=1
print(c)

Solution (Python):
nums = list(map(int, input().split()))
print(nums[1]//nums[2]-(nums[0]-1)//nums[2])

Solution (Python):

l, r, d = map(int, input().split())
 
print(r//d - (l-1)//d)

Solution (Python):
L,R,d = map(int,input().split())
l,r = (L-1)//d,R//d
print(r-l)

Solution (Python):
l,r,d = map(int,input().split())
     
print( r//d -(l-1)//d )

Solution (Python):
L, R, d = [int(i) for i in input().split()]
cnt = 0
for x in range(L, R+1):
    cnt += 1 if x % d == 0 else 0
print(cnt)

Solution (Python):
L,R,D=map(int,input().split())
count=0
for i in range(L,R+1):
  if i%D==0:
    count +=1
print(count)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r + 1):
  if i % d == 0:
    ans += 1
print(ans)

Solution (Python):
a, b, c = map(int, input().split())

d = 0

for i in range(a, b+1):
    if i % c == 0:
        d += 1

print(d)

Solution (Python):
L, R, d = map(int, input().split())

ans = 0
for i in range(L, R+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
L, R, d = [int(x) for x in input().split()]

count = 0

for i in range(L, R + 1):
    if i % d == 0:
        count = count + 1

print(count)

Solution (Python):
L, R, d = map(int, input().split())
ans = 0
for n in range(L, R + 1):
    if n % d == 0:
        ans += 1
print(ans)

Solution (Python):
L,R,d=map(int,input().split())
count=0
for i in range(L,R+1):
  if i%d == 0:
    count+=1
print(count)

Solution (Python):
L, R, d = map(int, input().split())

answer = 0
while L <= R:
    if L % d == 0:
        answer += 1   
    L += 1

print(answer)

Solution (Python):
l,r,d = map(int,input().split())

cnt = 0
for i in range(l,r+1):
    if(i%d==0):
        cnt += 1
print(cnt)

Solution (Python):
l,r,d = map(int,input().split())

print( r//d -(l-1)//d )

Solution (Python):
a, b, c = map(int, input().split())
d = 0
while a <= b:
  if a % c == 0:
    d = d+1
  a = a + 1
print(d)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r + 1):
    if not i % d:
        ans += 1

print(ans)

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline

    l, r, d = map(int, input().split())
    count = 0

    for i in range(l, r + 1):
        if i % d == 0:
            count += 1

    print(count)


if __name__ == '__main__':
    main()

Solution (Python):
numbers = [i for i in map(int, input().split())]
number_list = [i+numbers[0] for i in range(numbers[1]-numbers[0]+1)]
count = 0
for i in number_list:
  if i % numbers[2] == 0:
    count+=1
print(count)

Solution (Python):
l, r, d = list(map(int, input().split()))





print(r//d-(l-1)//d)

Solution (Python):
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    L, R, d = map(int, input().split())

    r = R // d
    l = (L - 1) // d
    print(r - l)


if __name__ == "__main__":
    main()

Solution (Python):
l, r, d = map(int, input().split())

print(r//d - (l-1)//d)

Solution (Python):
L, R, d = map(int, input().split())

print(sum(i % d == 0 for i in range(L, R + 1)))

Solution (Python):
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
a,b,c = map(int,input().split())

ans = 0

for i in range(a,b+1):
  if i%c==0:
    ans+=1
print(ans)

Solution (Python):
l,r,n = [int(x) for x in input().split(' ')]
c=0
for i in range(l,r+1):
  if(i%n==0):
    c+=1
print(c)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R + 1):
  if i % d == 0:
    count += 1
    
print(count)

Solution (Python):
ijyou,ika,sr = map(int,input().split())

count= 0

for i in range(ijyou,ika+1):
    if i % sr == 0:
        count += 1

print(count)

Solution (Python):
l, r, d = map(int, input().split())

if l % d == 0:
    a = l // d
    b = r // d
    print(b-a+1)
else:
    a = l // d
    b = r // d
    print(b-a)

Solution (Python):
import math
L, R, D = map(int, input().split())

print(math.floor(R / D) - math.ceil(L / D) + 1)

Solution (Python):
L, R, d = map(int, input().split())

print(R // d - (L - 1) // d)

Solution (Python):
l,r,d = map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
"""
    Satwik_Tiwari ;) .
    12th july , 2020  - Sunday
"""



from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase

from itertools import *
import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter  
from itertools import combinations as comb 
from itertools import permutations as permutate
from bisect import bisect_left as bl


from bisect import bisect_right as br
from bisect import bisect





BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)






mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") 
def out(var): sys.stdout.write(str(var))  
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())

def zerolist(n): return [0]*n
def nextline(): out("\n")  
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) : 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True





def solve():
    l,r,d =sep()
    print((r//d)-((l-1)//d))



testcase(1)

Solution (Python):
l,r,d=map(int, input().split())

ans=r//d-(l-1)//d
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
count=0
for i in range(a,b+1,1):
    if i%c==0:
        count=count+1
print(count)

Solution (Python):
l, r, d = map(int, input().split())

print(r//d - (l-1)//d)

Solution (Python):
l,r,d =map(int,input().split())

cnt = 0

for i in range(l,r+1):
  
  if i%d == 0:
    cnt += 1

print(cnt)

Solution (Python):
L, R, d = map(int, input().split())
result = 0

for i in range(L, R+1):
    if i % d == 0:
        result += 1

print(result)

Solution (Python):
l,r,d = map(int,input().split())
count = 0
for i in range(l,r + 1):
    if i % d == 0:
        count += 1
print(count)

Solution (Python):
l,r,d=map(int,input().split())

ans = 0
for i in range(l,r+1):
    if i % d == 0:
        ans += 1

print(ans)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
  if i%d == 0:
    ans += 1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
print(r // d - (l - 1) // d)

Solution (Python):
L,R,d = map(int,input().split())
ans = 0
for i in range(L,R+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
    if i % d == 0:
        ans += 1

print(ans)

Solution (Python):
l, h, d = map(int, input().split())
c = 0
for num in range(l, h+1):
  if num % d == 0:
    c += 1
print(c)

Solution (Python):
L,R,d = map(int,input().split())

ans = R//d - L//d

if L%d == 0:
    print(ans+1)
else:
    print(ans)

Solution (Python):


def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    L, R, d = list(map(int, input().split()))

    return L, R, d


def main(L: int, R: int, d: int) -> None:
    """
    メイン処理.

    Args:\n
        L (int): 整数（1 <= L <= R <= 100）
        R (int): 整数（1 <= L <= R <= 100）
        d (int): 整数（1 <= d <= 100）
    """
    
    ans = R // d - (L - 1) // d

    
    print(ans)


if __name__ == "__main__":
    
    L, R, d = get_input()

    
    main(L, R, d)

Solution (Python):
l,r,d=map(int,input().split())

count=0
for i in range(l,r+1):
  if i%d==0:
    count+=1
print(count)

Solution (Python):


L, R, d = list(map(int, input().split()))


ans = R // d - (L - 1) // d


print(ans)

Solution (Python):
L, R, d = map(int, input().split())

ans = 0
for i in range(L, R+1):
  if i % d == 0:
    ans += 1
print(ans)

Solution (Python):
L,R,d=(int(x) for x in input().split())
a=R//d
b=L//d
c=a-b
if L % d == 0:
  c=c+1
print(c)

Solution (Python):
l,r,d=map(int, input().split())

ans=0
for i in range(l,r+1):
  if i%d==0:
    ans+=1
print(ans)

Solution (Python):

l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):
l, r, d = map(int, input().split())
ans = r // d - (l - 1 ) // d
print(ans)

Solution (Python):
from sys import stdin
L, R, d = [int(_) for _ in stdin.readline().rstrip().split()]
ans = 0
for i in range(L, R+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
N, M ,L = map(int, input().split())
print(M//L-(N-1)//L)

Solution (Python):
l,r,d = map(int, input().split())
cnt = 0
for i in range(l, r+1):
  if i%d == 0:
    cnt+=1
print(cnt)

Solution (Python):
input_line = input().rstrip().split(' ')
l = int(input_line[0])
r = int(input_line[1])
d = int(input_line[2])

output = 0

for i in range(l,r+1):
    if i % d == 0:
        output = output + 1
        
print(output)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
l, r, d = map(int,input().split())
ans = 0
for i in range(l, r+1):
  if i%d == 0:
    ans +=1
print(ans)

Solution (Python):
l,r,d = [int(x) for x in input().split(' ')]
st = (l+d-1)//d
en = r//d
print(en-st+1)

Solution (Python):
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


L, R, d = MI()
ans = 0
for i in range(L, R + 1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
s = input().split(" ")
L = int(s[0])
R = int(s[1])
d = int(s[2])
cnt = 0
for i in range(L, R+1):
  if i%d == 0:
    cnt += 1
print(cnt)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
L,R,d = map(int,input().split())
print((R // d) - ((L - 1) // d))

Solution (Python):
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

Solution (Python):




def main():
    L, R, D = map(int, input().split())

    ans = 0

    for i in range(L, R + 1):
        if i % D == 0:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
l, r, d = map(int, input().split())
print(r // d - (l - 1) // d)

Solution (Python):
L, R, d = map(int, input().split())
cnt = 0
for i in range(L,R+1):
    if i % d == 0:
        cnt += 1
print(cnt)

Solution (Python):
L, R, D = map(int, input().split())
cnt = 0
for i in range(L, R+1):
    if i % D == 0:
        cnt += 1
print(cnt)

Solution (Python):
def solve(l, r, d):
    return r // d - (l-1) // d

l, r, d = map(int, input().split())
print(solve(l, r, d))

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
    if i % d == 0: ans += 1

print(ans)

Solution (Python):
l,r,d = map(int,input().split())

cnt = 0
for i in range(l,r+1):
    if i % d == 0:
        cnt += 1
print(cnt)

Solution (Python):
l,r,d = map(int, input().split())
ans = r//d - (l-1)//d
print(ans)

Solution (Python):
L,R,d = map(int,input().split())

cnt = 0
for i in range(L,R+1):
  if i%d == 0:
    cnt += 1
    
print(cnt)

Solution (Python):


import copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

L, R, d = LI()

ans = R // d - (L - 1) // d
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r+1):
  if i%d == 0:
    cnt += 1
print(cnt)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
while L != R+1:
    if L%d == 0:
        count += 1
    L += 1
print(count)

Solution (Python):
l,r,d = map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
l, r, d = map(int, input().split())
print(r//d-(l-1)//d)

Solution (Python):
count = 0
L,R,d = map(int,input().split())
for i in range(L,R+1):
  if i%d == 0:
    count += 1
print(count)