本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden ☆ before use]

1313. A. Fold the Paper Nicely


Description

Dr. Orooji has a daily calendar (365 pages) on his desk. Every morning, he tears off one page and, as he is reading the notes on the next page, he folds (out of habit) the sheet in his hand. Dr. O noticed that he always folds the sheet (a rectangular paper) along the longer side, e.g., if one side is 80 and the other side is 60, he would fold along 80; this will make the paper of size 40 and 60; if he folds it again, he would fold along 60 since that’s the longer side now.


The Problem:
Given a rectangular piece of paper and how many times Dr. O folds it, you are to determine the final sizes. When folding a side with an odd length, the fraction is ignored after folding, e.g., if a side is 7, it will become 3 after folding.

Input

The input consists of one line, containing three positive integers (each ≤ 10000), the first two providing the rectangle sides and the third providing the number of folds.

Output

Print the final values for the rectangle (larger side of the final values first).

Samples

Input Copy
60 51 4
Output
15 12

Hint

Explanation for the first Sample Input/Output: the rectangle starts with sides {60, 51} and successively becomes {30, 51}, {30, 25}, {15, 25}, {15, 12}.
Explanation for the last Sample Input/Output: the rectangle starts with sides {5, 800} and successively becomes {5, 400}, {5, 200}.

Source

UCF2018 PRACTICE
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 128MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
Contests involved

1035. UCF 2018 Practice
My history solutions

You didn't submit any solution!
Submit your solution

Login Register