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 = list(map(int, input().split()))
list_yakusuu = []
for i in range(1, c+1):
  if c % i == 0:
    list_yakusuu.append(i)
  else:
    continue
list_ans = []
for j in list_yakusuu:
  if a <= j <= b:
    list_ans.append(j)
  else:
    continue
print(len(list_ans))

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())
cnt=0
for i in range(a,b+1):
    if c%i==0:
        cnt+=1
print(cnt)

Solution (Python):
def make_divisor_list(num):
    if num < 1:
        return []
    elif num == 1:
        return [1]
    else:
        divisor_list = []
        divisor_list.append(1)
        for i in range(2, num // 2 + 1):
            if num % i == 0:
                divisor_list.append(i)
        divisor_list.append(num)

        return divisor_list


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

print(cnt)

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())

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())
ans = 0
y = a
while True:   
    if c%y==0:
      ans+=1
    y+=1
    if y>b:break
print(ans)

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

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

print(s)

Solution (Python):
a, b, c = [int(_) for _ in 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())
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())
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 i in range(a, b + 1):
    if c % i == 0:
        x += 1
        if i == b:
            print(str(x))
    else:
        if i == b:
            print(str(x))

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 = [int(n) for n in input().split()]
ans = 0
for i in range(a, b+1):
    if c%i == 0:
        ans += 1
print(ans)

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

for integer in range(a,b+1):
    if c % integer == 0:
        count = 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 = 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())

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

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 = int(0)
a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)
for n in range(b-a+1):
  if c%(a+n) == 0:
    s = s+1
print(s)

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

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

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())

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())
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())
ue = 0

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

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

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

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

print(len(yaku))

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())
print(sum(c%i==0 for i in range(a,b+1)))

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

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

if a == b and a <= c:
    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())
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)
"""
def divisible(x, y):
    return x % y == 0

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

for x in range(a, b + 1):
    if divisible(c, x):
        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())
count = 0
for i in range(a, b+1) :
    if c % i == 0:
        count += 1
print(count)

Solution (Python):
import sys


def main(lines=None):
    
    if not lines:
        lines = sys.stdin.readlines()
    lines = [line.split() for line in lines]
    a, b, c = [int(e) for inner_list in lines for e in inner_list]
    

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

    
    
    


def test_main():
    test_inputs = """
1 1 1
""".strip()
    test_inputs = test_inputs.split("\n")
    answer = main(test_inputs)
    expect = """
1
""".strip()

    assert answer == expect


if __name__ == "__main__":
    main()

Solution (Python):
nums = input().split(' ')
a = int(nums[0])
b = int(nums[1])
c = int(nums[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())

d = 0

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

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

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())
p = 0
for j in range(a,b + 1):
    if c%j==0:
        p = p+1
print(p)

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

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

print(an)

Solution (Python):
list_int = list(map(int, input().split()))

print(
    len(
        [
            i
            for i in range(list_int[1] - list_int[0] + 1)
            if list_int[2] % (i + list_int[0]) == 0
        ]
    )
)

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):
import sys


def I(): return int(sys.stdin.readline().rstrip())


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))


def S(): return sys.stdin.readline().rstrip()


def LS(): return list(sys.stdin.readline().rstrip().split())


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

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

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

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

import sys

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

print(len(yakusuu_array))

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())
ans = 0
for n in range(a,b+1):
  if c % n == 0:
    ans += 1
print(ans)

Solution (Python):
A,B,C = map(int, input().split())

l=list()
for i in range(A,B+1) :
    if C%i==0 :
        l.append(i)
    
print(len(l))

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

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

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

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

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

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(count)

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

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

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

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

sum=0

for i in range(a[0],a[1]+1): 
    if a[2] % i==0:
        sum+=1
print(sum)

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())

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())
d=0
for i in range(a,b+1):
    if c%i==0:
        d += 1
print(d)

Solution (Python):
a, b, c = (int(x) for x in 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())
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())
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 _ in range(a,b+1):
    if c%_==0:
        count+=1
print(count)

Solution (Python):
num_i, num_f, N = map(int, input().split(" "))

counter = 0
for n in range(num_i, num_f + 1):
    if N % n == 0:
        counter += 1
    else:
        next

print(counter)

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

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())

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

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("%d"%cnt)

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

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

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())
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(" "))
cdiv = []
for i in range(1,c//2+1):
    if c%i == 0:
        cdiv.append(i)
cdiv.append(c)
countn = 0
for divisor in cdiv:
    if divisor >= a and divisor <= b:
        countn += 1
print(countn)

Solution (Python):
import sys

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

if __name__=='__main__':
    main()

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

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

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

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
        if i == b:
            print(str(x))
    else:
        if i == b:
            print(str(x))

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):
n=list(map(int,input().split()))
a=n[0]
b=n[1]
c=n[2]
count=0
i=1
while i<=c:
    if c%i==0:
        if a<=i and i<=b:
            count+=1
    i+=1

print(count)

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

Solution (Python):
import sys

input = sys.stdin.readline

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):
a,b,c=map(int,input().split())
count=0
for i in range(a,b+1):
    x=c%i
    if x==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())

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
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):
a,b,c = map(int,input().split())
answer = 0

def is_prime(N):
  prime = []
  prime.append(1)
  prime.append(c)
  for i in range(1,N//2 + 1):
    if N % i == 0:
      prime.append(i)
  return prime

for i in range(a,b+1):
  if i in is_prime(c):
    answer += 1
print(answer)

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

Solution (Python):
a,b,c = map(int,input().split())
count = 0
for i in range(c):
    if c%(i+1) == 0:
        if a <= (i+1) <= b:
            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):
def divisible(x, y):
    return x % y == 0

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

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

print(count)

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

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

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):
a,b,c=list(map(int,input().split()))
ans = 0
while a <= b :
    if c % a == 0 :
        ans += 1
    a += 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())
n=0
for i in range(a,b+1):
    if c%i==0:
        n=n+1
print(n)

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 count_divisor(a:int,b:int,c:int)->int:
    n=0
    for i in range(a,b+1):
        if c % i == 0:
            n+=1
            
    return n


a,b,c=tuple(input().split())

print(count_divisor(int(a),int(b),int(c)))

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())
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())
d = 0
if a == b:
    while a != b+1:
        if c%a == 0:
            d += 1
            a += 1
        else:
            a += 1
elif b == c:
    while a != b+2:
        if c%a == 0:
            d += 1
            a += 1
        else:
            a += 1        
else:
    while a != b:
        if c%a == 0:
            d += 1
            a += 1
        else:
            a += 1
print(d)

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 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):
    if c % i == 0:
        cnt += 1
print(cnt)

Solution (Python):
a,b,c=[int(x) for x 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 = [int(x) for x in input().split()]
r=list(range(a,b+1))
co=0
for x in r:
	if c%x==0:
		co+=1

print(co)

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())
la=list(range(1,a,1))
lb=list(range(1,b+1,1))


lx=(set(la)^set(lb))

n=0
for i in lx:
    
        
    if c%i==0:
        n+=1
print(n)

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

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
    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=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
    else:
        d=d
print(d)

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

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

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

a,b,n = list(map(int,input().split()))
x = divisors(n)

y = [s for s in x if (s>=a)&(s<=b)]
print(len(y))

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

Solution (Python):
a,b,c=input().split()
A=int(a)
B=int(b)
C=int(c)
result=0
for e in range(A,B+1):
    if C % e == 0:
        result += 1
print(result)

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 x in range(a, b + 1):
    if c % x == 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=D+1
print(D)

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())
i=a
n=0
for i in range(a,b+1):
    if c%i==0:
        n+=1
    else:
        n==n

print(n)

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

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: continue
    j = c // i
    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 = n + 1
print(n)

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

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

Solution (Python):
i = input()
a, b, c = map(int, i.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())
j = 0

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

print(j)

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())
x=[]
for i in range(a,b+1):
    if c % i == 0:
        x.append(i)
print(len(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):


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):
a,b,c = map(int,input().split())
    
i = 0
n = a

while True:
    if c%n == 0:
        i += 1
    n += 1
    if n > b:
        break

print(i)

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

n = 0
if a == b :
    if c % a == 0 :
        n = n + 1

else :
    i = list(range(a, b+1))
    for x in i :
        if c % x == 0 :
            n = n + 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=(int(x) for x in input().split())
list=[]
for i in range(a,b+1):
   if c % i ==0:
      list.append(i)
print(str(len(list)))

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
    else:
        pass
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())
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())
i = 0

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

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())
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())

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):
def resolve():
    a,b,c = map(int,input().split())
    res = 0
    for i in range(a,b+1):
        if c % i == 0 : res += 1
    print(res)

if __name__ == "__main__":
    resolve()

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())
i=a
x=0
while b+1>i:
    if c%i==0:
        x+=1
    i+=1
print(x)

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

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
for r in range(a,b+1):
    if c%r==0:
        i+=1
print(i)

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())
count = 0

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

print('%d'%(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
    else :
        d += 0
print(d)

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

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

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(count)

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())

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())
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())
count=0
while a<=b:
    if c%a==0:
        count=count+1
    a=a+1
print(count)

Solution (Python):


a,b,c = (int(x) for x in input().strip().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())
sum=0
while a<=b:
    if c%a==0:
        sum=sum+1
    a=a+1
print(sum)

Solution (Python):



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

S = list(range(a,b+1))
Y = list()


for i in range(1,c+1):
    if c%i == 0:
        
        Y.append(i)
        
A = set(S)&set(Y)
print(len(A))

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

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

i = 1
cyakusu = []
while i**2 <= c:
    if i**2 < c:
        if c%i == 0:
            cyakusu.append(i)
            cyakusu.append(c//i)
    if i**2 == c:
        cyakusu.append(i)
    i += 1

n = len(cyakusu)

yakusu = []
for j in range(n):
    if a<=cyakusu[j]<=b :
        yakusu.append(cyakusu[j])

print(len(yakusu))

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

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

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())

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())
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())
e=0
while a<=b:
    x=c%b
    if x==0:
        e+=1
    else:
        pass
    b-=1    
print(e)

Solution (Python):
a,b,c = map(int,input().split())
ans = 0
while (a < b + 1) :
    if c % a == 0 :
        ans = ans + 1
    a = a + 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())
i=a
k=0
while i<=b:
    if c%i==0:
        k+=1
    i+=1
    
print(k)

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

Solution (Python):
a, b, c = list(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 = []
for i in range(a,b+1):
    if c%i == 0:
        x.append(i)

y =len(x)        
print(y)

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

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=input().split()
i=int(a)
k=0
while i<=int(b) :
    if int(c)%i==0 : k=k+1
    i=i+1
print(k)

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

Solution (Python):
a,b,c=raw_input().split()

common_diviser=[]
stage=[]
count=0
i=0
start=int(a)

for i in range(int(c)):
    i+=1
    if(int(c)%i==0):
        common_diviser.append(i)


area=int(b)-int(a)+1
for i in range(area):
    stage.append(start)
    start+=1

for i in range(area):
    if(stage[i] in common_diviser):
        i+=1
        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)