using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.IO;
using Number = System.Int64;
namespace Program {
    public class Solver {


        public void Solve() {
            long R = ri;
            long C = ri;
            var dx = ri % R; var dy = ri % C;
            var PX = R / gcd(R, dx);
            var PY = C / gcd(C, dy);
            var RC = R * C;
            var min = long.MaxValue;
            long ex = ri % R; long ey = ri % C;
            Func<long, bool> ok = k => {
                var A = new long[] { dx, dy };
                var B = new long[] { (k * ex) % R, (k * ey % C) };
                var M = new long[] { R, C };
                var res = MathEx.LiniearCongruence(A, B, M);
                return res.Key != -1;
            };
            ok(1);
            for (long i = 1; i * i <= RC; i++) {
                if (RC % i != 0) continue;
                if (ok(i)) min = Math.Min(min, i);
                if (ok(RC / i)) min = Math.Min(min, RC / i);

            }
            Console.WriteLine(lcm(PX, PY) * min - 1);

        }
        long lcm(long x, long y) {
            return x / gcd(x, y) * y;
        }
        long gcd(long x, long y) {
            if (y == 0) return x;
            return gcd(y, x % y);
        }


        const long INF = 1L << 60;
        //int[] dx = { -1, 0, 1, 0 };
        //int[] dy = { 0, 1, 0, -1 };
        //*
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        //*/

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }
    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read())
                if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}
#endregion


#region LinearCongruence
static public partial class MathEx {
    static Number ModInverse(Number num, Number mod) {
        Number p, q;
        ExGCD(num, mod, out p, out q);
        return (p % mod + mod) % mod;
    }


    /// <summary>
    /// (A_i)x???B_i mod(M_i)????§£???
    /// ????????????x(Mod M)????????¢
    /// </summary>
    static public KeyValuePair<Number, Number> LiniearCongruence(Number[] A, Number[] B, Number[] M) {
        Number x = 0;
        Number m = 1;
        var n = A.Length;
        for (int i = 0; i < n; i++) {
            var a = A[i] * m;
            var b = B[i] - A[i] * x;
            Number _x, _y;
            var d = ExGCD(M[i], a, out _x, out _y);
            if (b % d != 0) return new KeyValuePair<Number, Number>(-1, -1);
            var t = ((b / d) * ModInverse(a / d, M[i] / d)) % (M[i] / d);
            x = x + m * t;
            m *= M[i] / d;

        }
        x %= m;
        return new KeyValuePair<Number, Number>(x, m);
    }
}
#endregion

#region extended gcd
static public partial class MathEx {
    /// <summary>
    /// (a,b) ???gcd????±???????ax+by = gcd(a,b)?????? (x,y) ????±???????
    /// </summary>
    static public Number ExGCD(Number a, Number b, out Number x, out Number y) {
        if (a < 0) a = -a;
        if (b < 0) b = -b;
        x = 0;
        var u = y = 1;
        var v = x = 0;
        while (a > 0) {
            var q = b / a;
            { var t = x - q * u; x = u; u = t; }
            { var t = y - q * v; y = v; v = t; }
            { var t = b - q * a; b = a; a = t; }
        }
        return b;
    }
}
#endregion


Measured memory_bytes: 9628