#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
long long int csb(long long int x) {
  if (x <= 0) return 0;
  return (x % 2 == 0 ? 0 : 1) + csb(x / 2);
}
long long int tb(long long int n) {
  long long int count = 0;
  while (n) {
    count++;
    n >>= 1;
  }
  return count;
}
bool ip2(long long int n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  {
    long long int n, c = 0, f = 0, m = -1, e = -(long long int)1e9, o = 0,
                     p = 0, x = 0, y = 0, ans = 0, q = (long long int)1e9,
                     x1 = 0, y1, y3, x2, y2, k;
    cin >> n >> m >> k;
    for (long long int i = 0; i < k; i++) {
      cin >> x >> y;
    }
    long long int a[k][2];
    string s;
    for (long long int i = 0; i < n - 1; i++) {
      s.push_back('U');
    }
    for (long long int i = 0; i < m - 1; i++) {
      s.push_back('L');
    }
    x = 1;
    y = 1;
    multiset<pair<long long int, long long int>> m1;
    for (long long int i = 0; i < k; i++) {
      cin >> p >> q;
      m1.insert({p, q});
    }
    for (long long int i = 0; i < n; i++) {
      if (f == 0) {
        for (long long int j = 0; j < m - 1; j++) {
          s.push_back('R');
        }
        f = 1;
      } else {
        for (long long int j = 0; j < m - 1; j++) {
          s.push_back('L');
        }
        f = 0;
      }
      if (i == n - 1) break;
      s.push_back('D');
    }
    cout << s.size() << "\n" << s << "\n";
  }
  return 0;
}
