Problem:
How Many Divisors?  Write a program which reads three integers a , b and c , and prints the number of divisors of c between a and b .  Input  Three integers a , b and c are given in a line separated by a single space.  Output  Print the number of divisors in a line.  Constraints   1 ≤ a , b , c ≤ 10000   a ≤ b   Sample Input 1  5 14 80  Sample Output 1  3

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

yakusu = []

for i in range(1, c//2+1):
    if c%i == 0:
        yakusu.append(i)

yakusu.append(c)

cnt = 0
for i in range(len(yakusu)):
    x = yakusu[i]
    if a <= x and x <= b:
        cnt += 1

print(cnt)

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

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

z=0

while a<=b:
    
    if c%a==0:
        z+=1
    a+=1
    
print(z)

Solution (Python):
sum=0

a,b,c=map(int,input().split())
for x in range(a,b+1,1):
    if c%x==0:
        sum+=1
    else:
        continue
print(sum)

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

Solution (Python):
a, b, c = [int(arg) for arg in input().split()]

print(len([i for i in range(a, b+1) if c % i == 0]))

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

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

count = 0

x = a

while x <= b:
    if c % x == 0:
        count += 1

    else:
        pass

    x += 1

print(count)

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

Solution (Python):



cnt = 0
a, b, c = map(int, input().split())

for i in range(1, c + 1):
   if c % i == 0:
      if i >= a and i <= b:
         cnt += 1;
   
print(cnt)

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


if __name__ == "__main__":
    test_case()

Solution (Python):
a,b,c = (int(x) for x in input().split())
count = 0

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

print(count)

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

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

print(cnt)

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

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

result = 0
while True:
    if a > b:
        break
    if c % a == 0:
        result += 1
    a += 1
print(result)

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

print(n)

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

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

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

cnt = 0

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

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

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

z=[i for i in range(1,c+1) if c%i==0]

y=list(range(a, b+1))

t= y + z


k=[e for e in set(t) if t.count(e) == 2 ]


print(len(k))

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

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

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

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

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

Solution (Python):
x, y, z = map(int, input().split())
cnt = x
score = 0
while cnt <= y:
    if z % cnt == 0:
        score += 1
    cnt += 1
print(score)

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

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

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

Solution (Python):



def main():
    s = input()
    a, b, c = map(int, s.split())
    cnt = 0
    for d in range(a, b+1):
        if c % d == 0:
            cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

print(len(list))

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

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


if __name__ == "__main__":
    main()

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

count = 0
x = a

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

print(count)

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

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

print(count)

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

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

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

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

print(cnt)

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

print(count)

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

print(count)

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

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

print(count)

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

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

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

count = 0

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

print(count)

Solution (Python):
def main():
    div=[]
    a,b,c=map(int,input().split())
    for i in range(1,c+1):
        if c%i==0:
            div.append(i)
        
    count=0
    for i in div:
        if a<=i <=b:
            count+=1
    
    print(count)
    
 
if __name__ == '__main__':
    main()

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

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

ans = 0

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

print(ans)

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

print(count)

Solution (Python):
a, b, c = (int(i) for i in input().split())

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

print(count)

Solution (Python):
start, end, num = map(int, input().split())

result = 0
for i in range(start, end+1):
  if num % i == 0:
    result += 1

print(result)

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

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

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

Solution (Python):
a,b,c = (int(x) for x in input().split())

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

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

Solution (Python):
def divisors_list(mini, maxi, n):
    divisors = []
    for i in range(a, b + 1):
        if n%i == 0:
            divisors.append(i)
    return divisors


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





d = divisors_list(a, b, c)
print(len(d))

Solution (Python):

a, b, c = map(int, input().split())
count = 0
while a <= b:
    if c % a == 0:
        count += 1
        a += 1
    else:
        a += 1

print(count)

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

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

print(count_divisors)

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

	if c % i == 0:
		cnt = cnt + 1

print(cnt)

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

Solution (Python):
a, b, c=map(int,input().split())
cnt=0
for i in range(1,c+1):
    if c%i==0:
        if i>=a and i<=b:
            cnt+=1
        else:
            continue
    else:
        continue
    
print(cnt)

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

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

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

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

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

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

print(str(count))

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

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

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

Solution (Python):
a, b, c = map(int, input().split())
b = b + 1
z = []

for x in range(a, b):
    if c % x == 0:
        z.append(x)

print(len(z))

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

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

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

print ('%d' %count)

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

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

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

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

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

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

print(total)

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

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

cnt = 0
if a != b:
    for i in range(a, b + 1):
        if c % i == 0:
            cnt += 1
elif a == b and a <= c:
    if c % a == 0:
        cnt += 1
else:
    None

print(cnt)

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

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

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

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

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

Solution (Python):
a,b,c = input().split(" ")
i = int(a)
r = int(b) + 1
x = 0
num = 0
for i in range(int(a),r):
    num = int(c) % i
    if num == 0:
        x = x + 1
        continue
    elif num != 0:
        continue
    elif i == int(b):
        break
print(x)

Solution (Python):
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors

a,b,c=map(int, input().split())
divs=make_divisors(c)
print(sum(1 for i in divs if i>=a and i<=b))

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

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

i=a
count=0

while i<=b:
    
    if c%i==0:
        count+=1
        i+=1
        
    else:
        i+=1
        
print(count)

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

while a <= b:
    n = c % a
    if n == 0:
        i += 1
    a += 1

print(i)

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

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

Solution (Python):
a,b,c = [int(i) for i in input().split()]

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

print(cnt)

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

print(counter)

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

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

print(ans)

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

print(cnt)

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

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

div = [c]

for i in range(1,int(c*0.5)+1):
    if c % i == 0:
        div.append(i)

ans = []
sorted_div = sorted(div)
for j in range(len(sorted_div)):
    if a <= sorted_div[j] <= b:
        ans.append(sorted_div[j])
print(len(ans))

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

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

print(count)

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

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

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

Solution (Python):
list = input().split()
a = int(list[0])
b = int(list[1])
c = int(list[2])
count = 0

while True:
    if a > b:
        break
    if c % a == 0:
        count += 1
    a += 1
print(count)

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

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

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

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

Solution (Python):
base = input("")
term = base.split(' ')
x = int(term[0])
y = int(term[1])
z = int(term[2])

ans = 0
for i in range(x, y + 1, 1):
    if(z % i == 0):
        ans += 1

print(ans)

Solution (Python):
items = list(map(int, input().split()))
print(len(list(filter(lambda x: items[2] % x == 0, range(items[0], items[1] + 1)))))

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

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

Solution (Python):
count = 0
a,b,c = (int(x) for x in input().split())
n = a
while True:
    if n > b:
        print(count)
        break
    elif n >= a:
        if c%n == 0:
            count += 1
        n += 1

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

print(n)

Solution (Python):
a,b,c = map(int,input().split())
x = 0
n = a
while True:
    if c % n == 0:
        x += 1
    n += 1
    if n > b:
        break
print(x)

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

print(m)

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

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

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

ans = 0
N = [i for i in range(1, c + 1) if c % i == 0]

while a <= b:
    if a in N:
        ans += 1
    a += 1

print(ans)

Solution (Python):

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

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

if __name__ == '__main__':
  main()

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

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

Solution (Python):
a,b,c = map(int,input().split())
count = 0
num = a
while True:
  if c % num == 0:
      count += 1
      num += 1
      if num == b+1:
          break
  elif c % num != 0:
      num += 1
      if num == b+1:
          break

print(count)

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

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

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

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

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

print(num)

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

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

print(n)

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

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

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

print(cnt)

Solution (Python):

def test():
    inp = list(map(int, input().split()))
    count = 0
    for i in range(inp[0], inp[1] + 1):
        if inp[2] % i == 0:
            count += 1
    print(count)


if __name__ == '__main__':
    test()

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

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

print(out)

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

print(n)

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

num = a
ans = 0

while True:
    if c % num == 0 :
        ans += 1
    num += 1
    if b < num :
        break

print(ans)

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

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

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

Solution (Python):
a,b,c =map(int,input().split())
list = []
counter = 0
for i in range(1,int(c)+1):
    if(c%i == 0):
        list.append(i)
for j in list:
    if (j<=b and j>=a):
        counter += 1
print(counter)

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

count = 0
if a != b:
    for i in range(a,b+1):
        if c % i == 0:
            count += 1
else:
    if c%a==0:
        count = 1
print(str(count))

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

print(count)

Solution (Python):
a,b,c = map(int, input().split())
ans = 0
while True:
    if c%a == 0:
        ans = ans + 1
    a = a + 1
    if a > b:
        break
print(ans)

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

print(count)

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

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

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

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

ans = 0

while True:
    if c % a == 0:
        ans += 1
    a += 1
    if a > b:
        break

print(ans)

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


def F(n):
    lis = []
    for i in range(1, n+1):
        if n%i==0: lis.append(i)
    return lis
    
lis = F(c)
lis = [i for i in lis if a<=i<=b]
print(len(lis))

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

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

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

print(ans)

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

for y in range(a,b+1):
    z = c % y
    if z == 0:
        x += 1

print(x)

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

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

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

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

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

print(cnt)

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

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

Solution (Python):
num = input("").split()

a = int(num[0])
b = int(num[1])
c = int(num[2])

count = 0

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

Solution (Python):
a, b, c = map(int, input().split())
divisors = []
answer = []
for i in range(1, c + 1):
    if c % i == 0:
        divisors.append(i)
for num in divisors:
    if a <= num <= b:
        answer.append(num)
print(len(answer))

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

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c = (int(i) for i in input().split() )
cntdiv = 0

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

print(cntdiv)

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

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

print(count)

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

count = 0

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

print(count)

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

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

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

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

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

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

print(divisor)

Solution (Python):
import math
import copy
from copy import deepcopy
import sys
import fractions

from functools import reduce

import heapq
import collections
import itertools
sys.setrecursionlimit(100001)






def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList



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

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

print(cnt)

Solution (Python):

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

Solution (Python):
a,b,c=map(int,input().split())
l=[i for i in range(1,c+1) if c%i==0 and a<=i and b>=i]
print(len(l))

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

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

ans = 0
num = a

while True:
    if c%num == 0:
        ans += 1
    num += 1
    if num > b:
        break

print(ans)

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

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

Solution (Python):

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

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

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):

def make_divisors(n):
    divisors = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            divisors += [i, n // i]            
    divisors.sort()
    return divisors


a, b, c = map(int, input().split())
div_A = make_divisors(c)

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

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

Solution (Python):
s = input().rstrip().split(' ')
a = int(s[0])
b = int(s[1])
c = int(s[2])
sum = 0
for i in range(a, b + 1):
 if c % i == 0:
  sum += 1
print(sum)

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

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

Solution (Python):
ans = 0
a, b, c = [int(n) for n in input().split()]
for n in range(a, b+1):
    if (c/n).is_integer():
        ans += 1
print(ans)

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

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

Solution (Python):
a, b, c = map(int, input().split())
counter = []
for i in range(a, b+1):
    counter.append(c%i==0)
print(sum(counter))