Square Bounce

아직 제출이 없습니다시간 제한7초메모리 제한1024 MB

문제

Given a square in the plane with corners at (1,1)(-1,-1), (1,1)(-1,1), (1,1)(1,1) and (1,1)(1,-1), we fire a ray from point (1,0)(-1,0) into the interior of the square on a path with a given slope. The ray bounces off of the sides of the square with an angle of reflection which is the same as the angle of incidence to the side at the point of intersection.

After a number of bounces, the ray intersects one of the square's sides again at some point which has rational coordinates. Find those rational coordinates in reduced form.

입력

The single line of input contains three integers aa, bb and nn (1a,b,n1061 \le a,b,n \le 10^6, gcd(a,b)=1\gcd(a,b)=1), where the slope of the ray's initial path is a/ba/b, and there are nn bounces. Note that aa and bb are relatively prime. The slope will be chosen so that the ray never bounces at a corner of the square.

출력

Output a single line with four space-separated integers pp, qq, ss and tt, where (p/q,s/t)(p/q, s/t) is the final point where the ray hits a side of the square, p/qp/q and s/ts/t are in reduced form, and the denominators (qq and tt) are positive. If one of the coordinates has value 00, output it as 0 1.

힌트

The following is a picture of the first sample: