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:

<image>

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.
import java.io.*;
import java.io.PrintWriter;
import java.util.Arrays;

public class Q4{
	static class InputReader {
		InputStream is=System.in;
		byte[] bb = new byte[1 << 15];
		int k, l;
		byte getc() throws IOException {
			if (k >= l) {
				k = 0;
				l = is.read(bb);
				if (l < 0) return -1;
			}
			return bb[k++];
		}
		byte skip() throws IOException {
			byte b;
			while ((b = getc()) <= 32)
				;
			return b;
		}
		int nextInt() throws IOException {
			int n = 0;
			for (byte b = skip(); b > 32; b = getc())
				n = n * 10 + b - '0';
			return n;
		}
	}
	
	public static void main(String args[] ) throws Exception {
		InputReader  sc=new InputReader();
		PrintWriter out=new PrintWriter(System.out);
		int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int max = a*b*c+1;
 
        int[] num = new int[max];
        Arrays.fill(num,1);
        for(int i=2;i<max;++i) {
            for(int j=i;j<max;j+=i) {
                ++num[j];
            }
        }
 
        int prod,sum = 0;
        for(int i=1;i<=a;++i) {
            for(int j=1;j<=b;++j) {
                prod=i*j;
                for(int k=1;k<=c;++k) {
                    sum+=num[prod*k];
                }
            }
        }
 
        out.println(sum);
		out.flush();
	}
}