#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void rset();
void init_test();
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  init_test();
  return 0;
}
template <typename T>
void chmin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void MACRO_rdv2_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_rdv2_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_rdv2_Init(n, rest...);
}
template <typename T>
void MACRO_rdv2_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_rdv2_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_rdv2_Scan(p, rest...);
}
template <typename T>
void wrv(const vector<T>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    if (__ii) cout << ' ';
    cout << v[__ii];
  }
  cout << '\n';
}
template <typename T>
void wrm(const vector<vector<T>>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    for (int(__jj) = (0); (__jj) < (v[__ii].size()); ++(__jj)) {
      if (__jj) cout << ' ';
      cout << v[__ii][__jj];
    }
    cout << '\n';
  }
}
template <typename T>
void sc(T& x) {
  cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
  cin >> head;
  sc(tail...);
}
template <typename T>
void wr(const T& x) {
  cout << x << '\n';
}
template <typename Head, typename... Tail>
void wr(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wr(tail...);
}
template <typename T>
void wrf(const T& x) {
  cout << x << endl;
}
template <typename Head, typename... Tail>
void wrf(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wrf(tail...);
}
template <typename T>
void debug_out(const T& x) {
  cerr << x << '\n';
}
template <typename Head, typename... Tail>
void debug_out(const Head& head, const Tail&... tail) {
  cerr << head << ' ';
  debug_out(tail...);
}
template <typename... T>
void err(const T&... cod) {
  wr(cod...);
  exit(0);
}
vector<pair<int, string>> build(int n, int m) {
  vector<pair<int, string>> ans;
  if (m - 1) ans.emplace_back(m - 1, "R");
  if (m - 1) ans.emplace_back(m - 1, "L");
  ans.emplace_back(1, "D");
  for (int(i) = (0); (i) < (n - 1); ++(i)) {
    if (m - 1) ans.emplace_back(m - 1, "R");
    if (m - 1) ans.emplace_back(m - 1, "UDL");
    if (i < n - 2) ans.emplace_back(1, "D");
  }
  if (n - 1) ans.emplace_back(n - 1, "U");
  return ans;
}
void solve() {
  int n, m, k;
  sc(n, m, k);
  if (k > 4 * n * m - 2 * n - 2 * m) err("NO");
  vector<pair<int, string>> v = build(n, m), ans;
  for (auto p : v) {
    if (k < p.first * ((int)p.second.size())) {
      if (k / ((int)p.second.size()))
        ans.emplace_back(k / ((int)p.second.size()), p.second);
      k %= ((int)p.second.size());
      if (k > 0) ans.emplace_back(1, p.second.substr(0, k));
      break;
    }
    ans.emplace_back(p.first, p.second);
    k -= p.first * ((int)p.second.size());
  }
  wr("YES");
  wr(((int)ans.size()));
  for (auto p : ans) wr(p.first, p.second);
}
void init_test() {
  int qq = 1;
  while (qq--) solve();
}
