#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main() {
  cin >> n >> m >> k;
  int matriz[n + 2][m + 2];
  pair<int, int> s[k + 1];
  pair<int, int> f[k + 1];
  for (int i = 1; i <= k; ++i) cin >> s[i].first >> s[i].second;
  for (int i = 1; i <= k; ++i) cin >> f[i].first >> f[i].second;
  char dir = 'U';
  string road;
  for (int i = 1; i < n; i++) road.push_back('U');
  for (int i = 1; i < m; ++i) road.push_back('L');
  for (int i = 1; i <= m; ++i) {
    if (i % 2 == 1) dir = 'D';
    if (i % 2 == 0) dir = 'U';
    for (int j = 1; j < n; ++j) {
      road.push_back(dir);
    }
    if (i != m) road.push_back('R');
  }
  cout << road.size() << "\n";
  for (int i = 0; i < (int)road.size(); ++i) cout << road[i];
  cout << "\n";
  return 0;
}
