Let's denote *d*(*n*) as the number of divisors of a positive integer *n*. You are given three integers *a*, *b* and *c*. Your task is to calculate the following sum:

Find the sum modulo 1073741824 (2<sup class="upper-index">30</sup>).
The first line contains three space-separated integers *a*, *b* and *c* (1 ≤ *a*, *b*, *c* ≤ 100).
def count_divisors_sum(a, b, c):
    MOD = 1073741824  # 2^30
    
    # Create an array to store the number of divisors for each integer from 1 to b
    divisors = [0] * (b + 1)
    
    for i in range(1, b + 1):
        for j in range(i, b + 1, i):
            divisors[j] += 1
    
    # Calculate the sum modulo MOD for the specified range [a, b] using the constant c
    result = 0
    for i in range(a, b + 1):
        result = (result + divisors[i] * c) % MOD
    
    return result

# Example usage:
a = 1
b = 10
c = 2
result = count_divisors_sum(a, b, c)
print(result)  # This will print the sum modulo 1073741824 (2^30)

 				  			      				 		 	  	 	