#include <bits/stdc++.h>
using namespace std;
int MOD = 1e9 + 7;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a = a % MOD;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % MOD;
      b--;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
long long int fermat_inv(long long int y) { return power(y, MOD - 2); }
long long int gcd(long long int a, long long int b) {
  return (b == 0) ? a : gcd(b, a % b);
}
long long int min(long long int a, long long int b) { return (a > b) ? b : a; }
long long int max(long long int a, long long int b) { return (a > b) ? a : b; }
bool prime[1000001];
vector<int> primes;
void SieveOfEratosthenes(int n) {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (int p = 2; p < 1000001; p++)
    if (prime[p]) primes.push_back(p);
}
long long int fact[100005];
long long int finv[100005];
void factorial(int n) {
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= n; i++)
    fact[i] = fact[i - 1] * i, fact[i] %= MOD, finv[i] = fermat_inv(fact[i]);
}
long long int ncr(long long int n, long long int r) {
  if (n < r)
    return -1;
  else {
    long long int x = finv[r] * finv[n - r] % MOD;
    return fact[n] * x % MOD;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n, m, k;
    cin >> n >> m >> k;
    k++;
    int g[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        char ch;
        cin >> ch;
        g[i][j] = ch - '0';
      }
    }
    int dp[n][m][k];
    vector<int> back[n][m][k];
    memset(dp, -1, sizeof(dp));
    queue<vector<int> > q;
    for (int i = 0; i < m; i++) {
      q.push({n - 1, i, g[n - 1][i] % k});
      dp[n - 1][i][g[n - 1][i] % k] = g[n - 1][i];
    }
    while (!q.empty()) {
      auto a = q.front();
      q.pop();
      int x = a[0], y = a[1], z = a[2];
      if (x - 1 < 0) continue;
      ;
      if (y - 1 >= 0) {
        if (dp[x - 1][y - 1][(z + g[x - 1][y - 1]) % k] <
            dp[x][y][z] + g[x - 1][y - 1]) {
          q.push({x - 1, y - 1, (z + g[x - 1][y - 1]) % k});
          dp[x - 1][y - 1][(z + g[x - 1][y - 1]) % k] =
              dp[x][y][z] + g[x - 1][y - 1];
          back[x - 1][y - 1][(z + g[x - 1][y - 1]) % k] = {x, y, z};
        }
      }
      if (y + 1 < m) {
        if (dp[x - 1][y + 1][(z + g[x - 1][y + 1]) % k] <
            dp[x][y][z] + g[x - 1][y + 1]) {
          q.push({x - 1, y + 1, (z + g[x - 1][y + 1]) % k});
          dp[x - 1][y + 1][(z + g[x - 1][y + 1]) % k] =
              dp[x][y][z] + g[x - 1][y + 1];
          back[x - 1][y + 1][(z + g[x - 1][y + 1]) % k] = {x, y, z};
        }
      }
    }
    int ans = -1, x = 0, y, z = 0;
    for (int i = 0; i < m; i++) {
      if (dp[0][i][0] > ans) ans = dp[0][i][0], y = i;
    }
    cout << ans << '\n';
    if (ans != -1) {
      string r = "";
      while (x != n - 1) {
        vector<int> v = back[x][y][z];
        x++;
        z = v[2];
        if (v[1] > y)
          r = "L" + r;
        else
          r = "R" + r;
        y = v[1];
      }
      cout << y + 1 << '\n';
      cout << r;
    }
  }
}
