#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 20, S = 1e3;
const long long inf = 1e17;
long long p[N], a[N], b[N], ab[S][S];
char arch[N], cbl[S][S];
vector<long long> v, g[N];
bool mark[N], bb = false;
long long n, d, c, c1, m, k, q, l, r, mn = inf, mx1 = 0, mx = 0, ans = 0,
                                      ans1 = 0, ans2 = 1, cnt = 0, sum = 0,
                                      sum1 = 0;
int i = 0, j = 0, x, y;
string s, t;
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  c = 2 * m;
  for (int i = 1; i <= n; i++) {
    d = c * i;
    if (d >= k) {
      c1 = i;
      cout << i << ' ';
      break;
    }
  }
  c1 *= c;
  if (k % 2 == 0) {
    for (int i = m; i >= 1; i--) {
      if (c1 == k) {
        cout << i << ' ';
        break;
      }
      c1 -= 2;
    }
  } else {
    for (int i = m; i >= 1; i--) {
      if (c1 == k + 1) {
        cout << i << ' ';
        break;
      }
      c1 -= 2;
    }
  }
  if (k % 2 == 0) {
    cout << "R\n";
  } else {
    cout << "L\n";
  }
  return 0;
}
