#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> k;
  long long tot = 4 * n * m - 2 * n - 2 * m;
  if (tot < k) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  vector<pair<long long, string>> v;
  string LL = "";
  string RR = "";
  string UU = "";
  string DD = "";
  for (int i = 1; i < m; i++) {
    LL += "L";
    RR += "R";
  }
  for (int i = 1; i < n; i++) {
    UU += "U";
    DD += "D";
  }
  if (m > 1) {
    for (int i = 0; i < n - 1; i++) {
      if (k == 0) break;
      long long mx = (m - 1);
      long long step = 3;
      long long cnt = min(mx, k / step);
      if (cnt > 0) {
        v.push_back(make_pair(cnt, "RDU"));
        k -= step * cnt;
      }
      if (k == 0) break;
      if (cnt < mx) {
        v.push_back(make_pair(1, string("RDU").substr(0, k)));
        k = 0;
        break;
      }
      long long tt = min(mx, k);
      v.push_back(make_pair(tt, "L"));
      k -= tt;
      if (k == 0) break;
      k--;
      v.push_back(make_pair(1, "D"));
    }
    if (k != 0) {
      long long t1 = min(k, m - 1);
      if (t1 != 0) {
        v.push_back(make_pair(t1, "R"));
        k -= t1;
      }
    }
    if (k != 0) {
      long long t2 = min(k, m - 1);
      if (t2 != 0) {
        v.push_back(make_pair(t2, "L"));
        k -= t2;
      }
    }
  } else {
    long long t3 = min(k, n - 1);
    v.push_back(make_pair(t3, "D"));
    k -= t3;
  }
  if (k > 0) {
    v.push_back(make_pair(k, "U"));
    k = 0;
  }
  cout << v.size() << endl;
  assert(v.size() <= 3000);
  for (int i = 0; i < v.size(); i++) {
    cout << v[i].first << " " << v[i].second << endl;
  }
  return 0;
}
