#include <bits/stdc++.h>
using namespace std;
int d4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
template <class T>
void keep_max(T& a, const T& b) {
  if (a < b) a = b;
}
template <class T>
void keep_min(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void usort(vector<T>& a) {
  sort((a).begin(), (a).end());
  a.erase(unique((a).begin(), (a).end()));
}
int main() {
  ios::sync_with_stdio(false);
  int n, m;
  int p;
  cin >> n >> m >> p;
  int x[n];
  int y[m];
  for (int i = 0; i < (n); ++i) {
    cin >> x[i];
  }
  for (int i = 0; i < (m); ++i) {
    cin >> y[i];
  }
  int mem[2][m];
  int* f1 = mem[0];
  int* f2 = mem[1];
  int gapf[101][m];
  char path[201][m];
  f1[0] = (x[0] + y[0]) % p;
  for (int j = 1; j < m; ++j) {
    f1[j] = f1[j - 1] + (x[0] + y[j]) % p;
  }
  int gap_size = 0;
  memcpy(gapf[gap_size++], f1, sizeof(int) * m);
  for (int i = 1; i < n; ++i) {
    f2[0] = f1[0] + (x[i] + y[0]) % p;
    for (int j = 1; j < m; ++j) {
      f2[j] = max(f1[j], f2[j - 1]) + (x[i] + y[j]) % p;
    }
    if (i % 200 == 0) {
      memcpy(gapf[gap_size++], f2, sizeof(int) * m);
    }
    swap(f1, f2);
  }
  cout << f1[m - 1] << "\n";
  int sx = n - 1;
  int sy = m - 1;
  int last_f = f1[m - 1];
  char ans[m + n];
  int ans_size = 0;
  while (sx >= 0) {
    int gap = 0;
    while ((gap + 1) * 200 <= sx) ++gap;
    int gap_x = gap * 200;
    if (gap_x != sx) {
      f1[sy] = last_f;
      for (int j = sy - 1; j >= 0; --j) {
        f1[j] = f1[j + 1] - (x[sx] + y[j + 1]) % p;
        path[sx - gap_x][j] = 'S';
      }
      for (int i = sx - 1; i >= gap_x; --i) {
        f2[sy] = f1[sy] - (x[i + 1] + y[sy]) % p;
        path[i - gap_x][sy] = 'C';
        for (int j = sy - 1; j >= 0; --j) {
          int c = f1[j] - (x[i + 1] + y[j]) % p;
          int s = f2[j + 1] - (x[i] + y[j + 1]) % p;
          if (c < s) {
            f2[j] = c;
            path[i - gap_x][j] = 'C';
          } else {
            f2[j] = s;
            path[i - gap_x][j] = 'S';
          }
        }
        swap(f1, f2);
      }
      bool flag = false;
      for (int j = 0; j <= sy; ++j) {
        if (f1[j] == gapf[gap][j]) {
          vector<char> p;
          p.reserve(sx - gap + sy);
          int x = gap_x;
          int y = j;
          while (not(x == sx and y == sy)) {
            char dir = path[x - gap_x][y];
            p.push_back(dir);
            if (dir == 'C') {
              ++x;
            } else {
              ++y;
            }
          }
          for (int i = (int)p.size() - 1; i >= 0; --i) {
            ans[ans_size++] = p[i];
          }
          sx = gap_x;
          sy = j;
          flag = true;
          break;
        }
      }
    };
    ;
    while (sy > 0 and
           gapf[gap][sy - 1] + (x[sx] + y[sy]) % p == gapf[gap][sy]) {
      ans[ans_size++] = 'S';
      --sy;
    }
    last_f = gapf[gap][sy] - (x[gap_x] + y[sy]) % p;
    ;
    ;
    if (sx > 0) ans[ans_size++] = 'C';
    ;
    --sx;
  }
  reverse(ans, ans + ans_size);
  ans[ans_size] = '\0';
  cout << ans;
  return 0;
}
