#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int> > &p1,
                  const pair<int, pair<int, int> > &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 500 + 5, inf = 2e18;
long long int dp[105][105][12], n, m, k;
pair<long long int, long long int> par[105][105][12];
long long int a[105][105];
void solve() {
  cin >> n >> m >> k;
  vector<string> v(n);
  k++;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> v[i];
  }
  reverse(v.begin(), v.end());
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    for (long long int j = (long long int)0; j < (long long int)(m); j++)
      a[i][j] = v[i][j] - '0';
  }
  for (long long int i = (long long int)0; i < (long long int)(105); i++) {
    for (long long int j = (long long int)0; j < (long long int)(105); j++)
      for (long long int z = (long long int)0; z < (long long int)(12); z++)
        dp[i][j][z] = -1;
  }
  for (long long int i = (long long int)0; i < (long long int)(m); i++)
    dp[0][i][a[0][i] % k] = a[0][i];
  for (long long int i = (long long int)1; i < (long long int)(n); i++) {
    for (long long int j = (long long int)0; j < (long long int)(m); j++) {
      for (long long int z = (long long int)0; z < (long long int)(k); z++) {
        if (j - 1 >= 0) {
          if (dp[i - 1][j - 1][z] != -1) {
            long long int p = (z + (a[i][j] % k)) % k;
            if (dp[i][j][p] < dp[i - 1][j - 1][z] + a[i][j]) {
              dp[i][j][p] = dp[i - 1][j - 1][z] + a[i][j];
              par[i][j][p] = {j - 1, z};
            }
          }
        }
        if (j + 1 < m) {
          if (dp[i - 1][j + 1][z] != -1) {
            long long int p = (z + (a[i][j] % k)) % k;
            if (dp[i][j][p] < dp[i - 1][j + 1][z] + a[i][j]) {
              dp[i][j][p] = dp[i - 1][j + 1][z] + a[i][j];
              par[i][j][p] = {j + 1, z};
            }
          }
        }
      }
    }
  }
  long long int ans = -1, ind = -1;
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    if (ans < dp[n - 1][i][0]) {
      ans = dp[n - 1][i][0];
      ind = i;
    }
  }
  cout << ans << "\n";
  if (ind != -1) {
    vector<long long> t;
    int c = 0;
    t.push_back(ind);
    for (int j = n - 1; j > 0; j--) {
      t.push_back(par[j][ind][c].first);
      auto o = par[j][ind][c];
      c = o.second;
      ind = o.first;
    }
    cout << ind + 1 << '\n';
    string r = "";
    for (long long int i = (long long int)1; i < (long long int)(t.size());
         i++) {
      if (t[i] > t[i - 1]) {
        r.push_back('L');
      } else
        r.push_back('R');
    }
    reverse(r.begin(), r.end());
    cout << r << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
