영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There is a ball at the top-left corner of an n × m grid. The rows of the grid are numbered 1,2,…,n, and the columns are numbered 1,2,…,m.
The ball is initially moving diagonally away from the top-left corner. At every step, it moves one cell. Whenever the ball hits the border of the grid, it changes its direction.
What is the location of the ball after k steps and how many times has it changed direction?
Input
The first line has an integer t: the number of tests.
After this, there are t lines. Each line has three integers n, m and k: the size of the grid and the number of steps.
Output
For each test, print three integers: the location of the ball and the number of direction changes.
Constraints
- 1 ≤ t ≤ 1000
- 2 ≤ n,m ≤ 10^9
- 0 ≤ k ≤ 10^18
예제
예제 1
6 3 4 0 3 4 1 3 4 2 3 4 3 3 4 4 42 1337 123456789
1 1 0 2 2 0 3 3 1 2 4 2 1 3 3 34 300 3101295