Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Marathon

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputValera takes part in the Berland Marathon. The marathon race starts at the stadium that can be represented on the plane as a square whose lower left corner is located at point with coordinates (0, 0) and the length of the side equals *a* meters. The sides of the square are parallel to coordinate axes.

As the length of the marathon race is very long, Valera needs to have extra drink during the race. The coach gives Valera a bottle of drink each *d* meters of the path. We know that Valera starts at the point with coordinates (0, 0) and runs counter-clockwise. That is, when Valera covers *a* meters, he reaches the point with coordinates (*a*, 0). We also know that the length of the marathon race equals *nd* + 0.5 meters.

Help Valera's coach determine where he should be located to help Valera. Specifically, determine the coordinates of Valera's positions when he covers *d*, 2·*d*, ..., *n*·*d* meters.

Input

The first line contains two space-separated real numbers *a* and *d* (1 ≤ *a*, *d* ≤ 10^{5}), given with precision till 4 decimal digits after the decimal point. Number *a* denotes the length of the square's side that describes the stadium. Number *d* shows that after each *d* meters Valera gets an extra drink.

The second line contains integer *n* (1 ≤ *n* ≤ 10^{5}) showing that Valera needs an extra drink *n* times.

Output

Print *n* lines, each line should contain two real numbers *x*_{i} and *y*_{i}, separated by a space. Numbers *x*_{i} and *y*_{i} in the *i*-th line mean that Valera is at point with coordinates (*x*_{i}, *y*_{i}) after he covers *i*·*d* meters. Your solution will be considered correct if the absolute or relative error doesn't exceed 10^{ - 4}.

Note, that this problem have huge amount of output data. Please, do not use cout stream for output in this problem.

Examples

Input

2 5

2

Output

1.0000000000 2.0000000000

2.0000000000 0.0000000000

Input

4.147 2.8819

6

Output

2.8819000000 0.0000000000

4.1470000000 1.6168000000

3.7953000000 4.1470000000

0.9134000000 4.1470000000

0.0000000000 2.1785000000

0.7034000000 0.0000000000

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2022 13:54:04 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|