#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main() {
  cin >> n >> m >> k;
  int i;
  for (i = 1; i <= k; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
  }
  for (i = 1; i <= k; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
  }
  vector<char> v;
  for (i = 1; i <= n - 1; i++) {
    v.push_back('D');
  }
  for (i = 1; i <= m - 1; i++) {
    v.push_back('R');
  }
  int x, y;
  if (m % 2 != 0) {
    int num = (m - 1) / 2;
    int j, k;
    for (i = 1; i <= num; i++) {
      for (j = 1; j <= n - 1; j++) v.push_back('U');
      v.push_back('L');
      for (j = 1; j <= n - 1; j++) v.push_back('D');
      v.push_back('L');
    }
    for (j = 1; j <= n - 1; j++) v.push_back('U');
  } else {
    int num = (m - 2) / 2;
    int j, k;
    for (i = 1; i <= num; i++) {
      for (j = 1; j <= n - 1; j++) v.push_back('U');
      v.push_back('L');
      for (j = 1; j <= n - 1; j++) v.push_back('D');
      v.push_back('L');
    }
    for (j = 1; j <= n - 1; j++) v.push_back('U');
    v.push_back('L');
    for (j = 1; j <= n - 1; j++) v.push_back('D');
  }
  cout << v.size() << endl;
  for (i = 0; i < v.size(); i++) cout << v[i];
}
