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.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class second146 {
    static int p = 1073741824;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt(),  b = sc.nextInt(),  c = sc.nextInt();
        
        int sum = 0;
        
        for (int i = 1; i <= a; i++) {
            for (int j = 1; j <= b; j++) {
                for (int k = 1; k <= c; k++) {
                    int numb =  i * j * k;
                
                    int ans = funct(numb);
                    sum = (sum + ans) % p;
                    
                    
                }
            }
        }
        
        System.out.println(sum);
        
    }
    
    private static int funct ( int n){
        if(n == 1) return 1;
    
        int sqrt = (int)Math.sqrt(n);
        int[] primes = new int[sqrt];
        
        
        ArrayList<Integer> array = new ArrayList<Integer>();
        int numb = n;
        
        for(int i=2; i * i<=n; i++){
            if(n%i==0) array.add(i);
            while(n%i==0){
                n=n/i;
                
            }
        }
            if(n>1) array.add(n);
            int[] pows = new int[array.size()];
        
            
            
        for (int i = 0; i < array.size(); i++) {
            while(numb % array.get(i) == 0) {
                
                pows[i] ++;
                numb = numb / array.get(i);
            }
            
        }
        
            
        int ans = 1;
        for (int i = 0; i < pows.length; i++) {
            
                ans = (ans * (pows[i] + 1) ) %p;
                
                
        }
        
        return ans;
        
    }
    
}
