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

public class Main {

    public static void main(String[] args) {
        p6();

    }

    private static void p1(){
        Scanner scanner=new Scanner(System.in);
        int A=scanner.nextInt();
        int Asum=0;
        for (int i=2;i<A;i++){
            int tempA=A;
            int maxLength=(int)Math.ceil(Math.log(A)/Math.log(i))+1;
            //int[] array=new int[maxLength];
            int sum=0;
            for (int j=0;j<maxLength;j++){
                //array[j]=tempA%i;
                sum+=tempA%i;
                tempA/=i;
            }
            Asum+=sum;
        }
        int gcd=gcd(Asum,A-2);
        System.out.println(Asum/gcd+"/"+(A-2)/gcd);
    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static int gcd(int a,int b){
        if(b==0){
            return a;
        }else{
            return gcd(b,a%b);
        }
    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static void p2(){
        Scanner scanner=new Scanner(System.in);
        int[] n=new int[5];
        for (int i=0;i<5;i++){
            n[i]=scanner.nextInt();
        }
        int sum=0;
        for(int i=1;i<=n[4];i++){
            for (int j=0;j<4;j++){
                if(i%n[j]==0){
                    sum++;
                    break;
                }
            }
        }
        System.out.println(sum);

    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static void p3(){

    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static void p4(){
        Scanner scanner=new Scanner(System.in);
        int n=scanner.nextInt();
        int k=scanner.nextInt();
        for (int i = 0; i < k; ++i)
        {
            System.out.printf("%d ", n - i);
        }
        System.out.print("1");
        for (int i = 2; i <= n - k; ++i)
        {
            System.out.printf(" %d", i);
        }
        System.out.println();

    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static void p5(){
        Scanner scanner=new Scanner(System.in);
        String n=scanner.next();
        int counter=0;
        while (n.length()>1){
            counter++;
            int n2=0;
            for (int i=0,l=n.length();i<l;i++){
                n2+=n.charAt(i)-'0';
            }
            n=Integer.toString(n2);
        }
        System.out.println(counter);
    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static void p6(){
        Scanner scanner=new Scanner(System.in);
        int a=scanner.nextInt();
        int b=scanner.nextInt();
        int c=scanner.nextInt();
        long[] array=new long[a*b*c+1];
        long sum=0;
        for (int i=1;i<=a;i++){
            for (int j=1;j<=b;j++){
                for (int k=1;k<=c;k++){
                    int p=i*j*k;
                    if(array[p]==0){
                        array[p]=p6d(p);
                        sum+=array[p];
                    }else{
                        sum+=array[p];
                    }
                    sum%=1073741824;
                }
            }
        }
        System.out.println(sum);

    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

    private static int p6d(int p){
        if(p==1){
            return 1;
        }
        int c=0;
        if ((int)Math.sqrt(p)==Math.sqrt(p)){
            c--;
        }
        for (int i=1,ps=(int)Math.sqrt(p)+1;i<ps;i++){
            if(p%i==0){
                c=c+2;
            }
        }
        return c;
    }

    //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
}
