#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T& a, const T& b) {
  a = max(a, b);
}
template <class T>
void chmin(T& a, const T& b) {
  a = min(a, b);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m, k, cnt = 0;
  cin >> n >> m >> k;
  vector<char> V;
  for (int i = 0; i < n - 1; i++) {
    ++cnt;
    V.push_back('U');
  }
  for (int i = 0; i < m - 1; i++) {
    ++cnt;
    V.push_back('L');
  }
  int flag = 1;
  for (int i = 0; i < m - 1; i++) V.push_back('R'), ++cnt;
  for (int i = 0; i < n - 1; i++) {
    ++cnt;
    V.push_back('D');
    if (flag == 1) {
      for (int i = 0; i < m - 1; i++) V.push_back('L'), ++cnt;
    } else {
      for (int i = 0; i < m - 1; i++) V.push_back('R'), ++cnt;
    }
    flag *= -1;
  }
  cout << cnt;
  cout << endl;
  for (auto u : V) cout << u;
  return 0;
}
