#include <bits/stdc++.h>
using namespace std;
bool siv[100000];
vector<long long> prime;
void sieve();
void pri();
long long int fact(long long int n);
int main() {
  int r, c, cell;
  scanf("%d %d %d", &r, &c, &cell);
  c = c * 2;
  int ans_c = c;
  int ans_2 = 1;
  while (cell > ans_c) {
    ans_c += c;
    ans_2++;
  }
  ans_c -= c;
  int ans_1 = 0;
  while (cell > ans_c) {
    ans_c += 2;
    ans_1++;
  }
  char ans_dirc;
  if (ans_c == cell) {
    ans_dirc = 'R';
  } else {
    ans_dirc = 'L';
  }
  cout << ans_2 << " " << ans_1 << " " << ans_dirc << endl;
}
void sieve() {
  memset(siv, true, sizeof(siv));
  int root = sqrt(100000);
  for (int i = 2; i <= root; i++) {
    for (int j = i * 2; j <= 100000; j += i) {
      siv[j] = false;
    }
  }
}
void pri() {
  sieve();
  siv[0] = false;
  siv[1] = false;
  for (int i = 0; i < 100000; i++)
    if (siv[i] == true) prime.push_back(i);
}
long long int fact(long long int n) {
  long long int ans = 1;
  for (long long int i = 1; i <= n; i++) {
    ans *= i;
  }
  return ans;
}
