#include <bits/stdc++.h>
using namespace std;
inline long long int maxim(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
inline long long int minim(long long int a, long long int b) {
  if (a < b)
    return a;
  else
    return b;
}
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
bool prime[3001];
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= 3000; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 3000; i += p) prime[i] = false;
    }
  }
}
long long int ncr[1001][1001];
long long int binpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}
long long int modpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 100000;
    a = (a * a) % 100000;
    b >>= 1;
  }
  return res;
}
long long int arr[1000010] = {0};
long long int c[1000010] = {0};
long long int d[1000010] = {0};
vector<vector<long long int> > love;
stack<long long int> z;
long long int king[1000010] = {0};
long long int temp[1000010] = {0};
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  cout << setprecision(10) << fixed;
  long long int n, m;
  cin >> n >> m;
  long long int k;
  cin >> k;
  for (long long int o = 0, _n = (k); o < _n; o++) {
    long long int u, i;
    cin >> u >> i;
    long long int d, f;
    cin >> d >> f;
  }
  long long int total = (n - 1) + (m - 1) + m * n - 1;
  string ans = "";
  for (long long int o = 0, _n = (n - 1); o < _n; o++) {
    ans += "D";
  }
  for (long long int o = 0, _n = (m - 1); o < _n; o++) {
    ans += "R";
  }
  string tra = "";
  for (long long int o = 0, _n = (n - 1); o < _n; o++) {
    tra += "U";
  }
  tra += "L";
  for (long long int o = 0, _n = (n - 1); o < _n; o++) {
    tra += "D";
  }
  tra += "L";
  long long int x = (m - 1) / 2;
  for (long long int o = 0, _n = (x); o < _n; o++) {
    ans += tra;
  }
  long long int yt = m - x * 2 - 1;
  if (yt == 0) {
    for (long long int o = 0, _n = (n - 1); o < _n; o++) {
      ans += 'U';
    }
  } else {
    for (long long int o = 0, _n = (n - 1); o < _n; o++) {
      ans += "U";
    }
    ans += "L";
    for (long long int o = 0, _n = (n - 1); o < _n; o++) {
      ans += "D";
    }
  }
  cout << total << endl;
  cout << ans << endl;
  return 0;
}
