AKOJ正在加载中...

3917: Easy Number Challenge

金币值:2 定数:1 时间限制:2.000 s 内存限制:256 M
正确:0 提交:0 正确率:0.00% 命题人:
点赞量:0 收藏量:0 题目类型:程序

题目描述

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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

Input

The first line contains three space-separated integers a, b and c (1≤a,b,c≤100).

Output

Print a single integer − the required sum modulo 1073741824 (230).

Examples
Input
2 2 2
Output
20
Input
5 6 7
Output
1520
Note

For the first example.

  • d(1·1·1)=d(1)=1;
  • d(1·1·2)=d(2)=2;
  • d(1·2·1)=d(2)=2;
  • d(1·2·2)=d(4)=3;
  • d(2·1·1)=d(2)=2;
  • d(2·1·2)=d(4)=3;
  • d(2·2·1)=d(4)=3;
  • d(2·2·2)=d(8)=4.

So the result is 1+2+2+3+2+3+3+4=20.