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^{30}).
The first line contains three space-separated integers a, b and c (1 ≤ a, b, c ≤ 2000).
Print a single integer — the required sum modulo 1073741824 (2^{30}).
2 2 2
20
4 4 4
328
10 10 10
11536
For the first example.
So the result is 1 + 2 + 2 + 3 + 2 + 3 + 3 + 4 = 20.
Name |
---|