You have been asked to discover some important properties of one strange sequences set. Each sequence of the parameterized set is given by a recurrent formula:

where n > 1, and the value of F(X,Y) is evaluated by the following algorithm:

1. find H = (A₁*X*Y + A₂*X + A₃*Y + A₄);
2. if H > B₁ then H is decreased by C until H ≤ B₂;
3. the resulting value of H is the value of function F.

The sequence is completely defined by nonnegative constants A₁, A₂, A₃, A₄, B₁, B₂ and C.

One may easily verify that such sequence possess a property that X_p+n = X_p+q+n for appropriate large enough positive integers p and q and for all n ≥ 0. You task is to find the minimal p and q for the property above to hold. Pay attention that numbers p and q are well defined and do not depend on way minimization is done.

The first line contains seven integers: A₁, A₂, A₃, A₄, B₁, B₂ and C. The first two members of sequence (X₁ and X₂) are placed at the second line. You may assume that all intermediate values of H and all values of F fit in range [0..100000].

An output should consist of two integers (p and q) separated by a space.