In this problem, `lattice points' in the plane are points with integer coordinates.

In order to contain his cows, Farmer John constructs a triangular electric fence by stringing a "hot" wire from the origin (0,0) to a lattice point [n,m] (0<=;n<32,000, 0<m<32,000), then to a lattice point on the positive x axis [p,0] (0<p<32,000), and then back to the origin (0,0).

A cow can be placed at each lattice point within the fence without touching the fence (very thin cows). Cows can not be placed on lattice points that the fence touches. How many cows can a given fence hold?

The single input line contains three space-separated integers that denote n, m, and p.

A single line with a single integer that represents the number of cows the specified fence can hold.

#include<bits/stdc++.h>

using namespace std;

//pick:2s=2a+b-2;

//a内部点 b边界点 s多边形面积

int main()

{

    int n,m,p,b1,b2,a;

    double s;

    cin>>n>>m>>p;

    s=p*m*1.0/;

    if(n!=)

        b1=__gcd(n,m)-;        //线段上除2个端点外的格点数

    else if(n==)b1=m-;

    if(p!=n)

        b2=__gcd(abs(n-p),m)-;

    else if(p==n)b2=m-;

    a=s-(b1+b2+p+)/+;

    cout<<a<<endl;

    return ;

}