#include <bits/stdc++.h>
using namespace std;
int m, n, k;
queue<pair<int, string> > ans;
void Run(int t, string s) {
  if (t == 0) return;
  if (k > t * s.size()) {
    k -= t * s.size();
    ans.push(make_pair(t, s));
    return;
  }
  while (t * s.size() > k) t--;
  if (t > 0) ans.push(make_pair(t, s));
  k -= t * s.size();
  if (k > 0) {
    string tmp = s.substr(0, k);
    ans.push(make_pair(1, tmp));
  }
  cout << "YES" << endl;
  cout << ans.size() << endl;
  while (!ans.empty()) {
    cout << ans.front().first << ' ' << ans.front().second << endl;
    ans.pop();
  }
  exit(0);
}
int main() {
  cin >> m >> n >> k;
  if (k > 4 * m * n - 2 * n - 2 * m) {
    cout << "NO";
    return 0;
  }
  int curX = 1, curY = 1;
  int remain = (n - 1) - ((n - 1) / 4 * 4);
  int a = (n - 1 - remain) / 4;
  Run(a, "RRRR");
  string tmp;
  for (int i = 1; i <= remain; i++) tmp = tmp + 'R';
  if (remain > 0) Run(1, tmp);
  tmp = "";
  for (int i = 1; i <= remain; i++) tmp = tmp + 'L';
  tmp = tmp + 'D';
  for (int i = 1; i <= m - 1; i++) {
    Run(a, "LLLL");
    Run(1, tmp);
    Run(n - 1, "RUD");
  }
  Run(a, "LLLL");
  if (remain > 0) Run(1, tmp.substr(0, remain));
  a = (m - 1) / 4;
  remain = (m - 1) - a * 4;
  Run(a, "UUUU");
  tmp = "";
  for (int i = 1; i <= remain; i++) tmp = tmp + 'U';
  if (remain > 0) Run(1, tmp);
}
