Sakurako was walking with her dog Martel. They found a chocolate bar divided into n\cdot m squares with rows and columns. More formally, the chocolate bar can be represented as a rectangle with lines passing through only integer points and lines parallel to the coordinate axes.
Since Sakurako believes that they both found the chocolate bar, they need to divide it. Sakurako should receive squares and Martel squares. At the same time, they need to make at most one cut of the chocolate bar, as otherwise, it will be inconvenient to carry it. Also, the chocolate bar can be cut only by straight lines without cutting the squares into pieces. Help Sakurako determine whether it is possible to cut the chocolate bar in this way.
First line contains two integers and (1\le n,m\le 10^9).
Second line contains two integers and (1\le x,y\le 10^{18}).
Output "Yes" if it is possible to divide it in this way, or "No" otherwise.
Note that it is recommended to use 64-bit integers (for example, long long in C++).
Example 1
Example 2
Example 3
In the first example, you can cut the chocolate of size 2\times 3 using one cut into 2\times 1 and 2 \times 2 pieces. This would satisfy the requirements of both Sakurako and Martel (since Sakurako wants squares and Martel wants and 2=2\times 1, 4=2\times 2).
In the second example, they can cut chocolate 3\times 4 into chocolates with 3\times 2 squares each. This satisfies the requirements.
We can prove that there is no way of satisfying our constraints in the third test.
In this problem, there are conditional blocks. If your solution works correctly for certain constraints, it will receive a certain number of points. Note that testing is going test by test, but not by blocks.
( points): n,m\le 10^5;
( points): without additional constraints.