Number Game

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 sum: ∑ (i=1) to a ∑ (j=1) to b ∑(k=1) to c d(i.j.k). Find the sum modulo 1073741824 (2^30). Input The first line contains three space-separated integers a, b and c Output Print a single integer — the required sum modulo 1073741824 (2^30). Constraints - 1 ≤