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.util.*;
 
public class B 
{	
	static long mod=1073741824L;
	public static void main(String[] args)throws IOException 
	{	
		FastReader f=new FastReader();
		StringBuffer sb = new StringBuffer();
		
		int a=f.nextInt();
		int b=f.nextInt();
		int c=f.nextInt();
		
		int prod=a*b*c;
		int seive[]=primeSeive(prod);
		
		long ans=0;
		
		for(int i=1;i<=a;i++)
			for(int j=1;j<=b;j++)
				for(int k=1;k<=c;k++)
					ans=(ans%mod + func(i*j*k,seive)%mod)%mod;
		System.out.println(ans);
	}
	
	static long func(int a,int seive[])
	{
		long ans=1;
		Map<Integer,Integer> map=new HashMap<>();
		
		while(a>1)
		{
			int x=seive[a];
			if(map.containsKey(x))
				map.put(x,map.get(x)+1);
			else
				map.put(x,1);
			a=a/x;
		}
		for(int key : map.keySet())
			ans=(ans%mod*(long)(map.get(key)+1)%mod)%mod;
		return ans;
	}
	
	public static int[] primeSeive(int n) {
		int a[] = new int[n + 1];
		for (int i = 1; i < a.length; i++)
			a[i] = i;

		for (int i = 2; i <= Math.sqrt(n); i++) {
			if (a[i] != i)
				continue;
			for (int j = i * i; j <= n; j += i) {
				if (a[j] == j)
					a[j] = i;
			}
		}
		return a;
	}
	
	
	static class FastReader 
	{ 
	    BufferedReader br; 
	    StringTokenizer st; 

	    public FastReader() {
	    	br = new BufferedReader(new
	                 InputStreamReader(System.in)); 
	    }
	    String next() { 
	        while (st == null || !st.hasMoreElements()) { 
	            try{ 
	                st = new StringTokenizer(br.readLine()); 
	            } 
	            catch (IOException  e) { 
	                e.printStackTrace(); 
	            } 
	        } 
	        return st.nextToken(); 
	    } 
	    int nextInt() { 
	        return Integer.parseInt(next()); 
	    } 
	    long nextLong() { 
	        return Long.parseLong(next()); 
	    } 
	    double nextDouble() { 
	        return Double.parseDouble(next()); 
	    } 
	    String nextLine() { 
	        String str = ""; 
	        try{ 
	            str = br.readLine(); 
	        } 
	        catch (IOException e) { 
	            e.printStackTrace(); 
	        } 
	        return str; 
	    } 
	} 
}