Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are *n* lanes of *m* desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to *n* from the left to the right, the desks in a lane are numbered from 1 to *m* starting from the blackboard. Note that the lanes go perpendicularly to the blackboard, not along it (see picture).

The organizers numbered all the working places from 1 to 2*nm*. The places are numbered by lanes (i. e. all the places of the first lane go first, then all the places of the second lane, and so on), in a lane the places are numbered starting from the nearest to the blackboard (i. e. from the first desk in the lane), at each desk, the place on the left is numbered before the place on the right.

Santa Clause knows that his place has number *k*. Help him to determine at which lane at which desk he should sit, and whether his place is on the left or on the right!
The only line contains three integers *n*, *m* and *k* (1 ≤ *n*, *m* ≤ 10 000, 1 ≤ *k* ≤ 2*nm*) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place.
The first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example.

In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his place is in the first lane at the second desk on the right.
4 3 9
2 2 L
4 3 24
4 3 R
2 4 4
1 2 R
3 10 24
2 2 R
10 3 59
10 3 L
10000 10000 160845880
8043 2940 R
1 1 1
1 1 L
1 1 2
1 1 R
1 10000 1
1 1 L
1 10000 20000
1 10000 R
10000 1 1
1 1 L
10000 1 10000
5000 1 R
10000 1 20000
10000 1 R
3 2 1
1 1 L
3 2 2
1 1 R
3 2 3
1 2 L
3 2 4
1 2 R
3 2 5
2 1 L
3 2 6
2 1 R
3 2 7
2 2 L
3 2 8
2 2 R
3 2 9
3 1 L
3 2 10
3 1 R
3 2 11
3 2 L
3 2 12
3 2 R
300 2000 1068628
268 314 R
300 2000 584756
147 378 R
300 2000 268181
68 91 L
10000 9999 186450844
9324 4745 R
10000 9999 197114268
9857 6990 R
10000 9999 112390396
5621 818 R
10000 10000 1
1 1 L
10000 10000 2
1 1 R
10000 10000 100000001
5001 1 L
10000 10000 199999999
10000 10000 L
10000 10000 200000000
10000 10000 R
1 2 1
1 1 L
1 2 2
1 1 R
1 2 3
1 2 L
1 2 4
1 2 R
2 1 1
1 1 L
2 1 2
1 1 R
2 1 3
2 1 L
2 1 4
2 1 R
4 3 7
2 1 L
1 1 1
1 1 L
n,m,k = map(int, input().strip().split())
n = 0
i = 1
j = m * 2
o = 1
answn = 0
answm = 0
while answn == 0:
    if k <= j and k >= i:
        answn = o
    else:
        i += m * 2
        j += m * 2
        o += 1
i = 1 + (o - 1) * 2 * m
j = 2 + (o - 1) * 2 * m
o = 1
while answm == 0:
    if k <= j and k >= i:
        answm = o
    else:
        i += 2
        j += 2
        o += 1
if k % 2 == 0:
    print(answn,answm,'R')
else:
    print(answn,answm,'L')
    