PROGRAMMING:Origami
A large enough rectangular paper, each time fold the long side (if it is a square, then choose any side), for example, two rectangular paper with side lengths of 10 and 9, fold the side length of 5 and 9, fold the side length of 5 and 4 again (the length is odd, fold it in half and round down). For a given length of two sides and fold times, find the final length of the side, from large to small output.
###Input format:
Input three positive integers a, B, n (all less than 10000) in one line, which are the length of two sides and the number of fold.
###Output format:
Output the length of the two sides after folding n times in the order of big to small in a row, separated by a space in the middle.
###Input sample 1:
```in
3 2 1
```
###Output sample 1:
```out
2 1
```
###Input sample 2:
```in
3 2 10
```
###Output sample 2:
```out
0 0
```
answer：If there is no answer, please comment
###Input format:
Input three positive integers a, B, n (all less than 10000) in one line, which are the length of two sides and the number of fold.
###Output format:
Output the length of the two sides after folding n times in the order of big to small in a row, separated by a space in the middle.
###Input sample 1:
```in
3 2 1
```
###Output sample 1:
```out
2 1
```
###Input sample 2:
```in
3 2 10
```
###Output sample 2:
```out
0 0
```
answer：If there is no answer, please comment