#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  if (k > 4 * m * n - 2 * n - 2 * m) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  vector<pair<int, string> > ans;
  int step;
  if (n <= m) {
    step = min(k, m - 1);
    ans.push_back({step, "R"});
    k -= step;
    step = min(k, m - 1);
    if (step) ans.push_back({step, "L"});
    k -= step;
    for (int i = 1; k > 0 && i < n; ++i) {
      ans.push_back({1, "D"});
      k -= 1;
      step = min(k, 3 * (m - 1));
      if (step / 3) ans.push_back({step / 3, "RUD"});
      if (k == step) {
        k -= step / 3 * 3;
        if (k == 1)
          ans.push_back({1, "R"});
        else if (k == 2)
          ans.push_back({1, "RU"});
        k = 0;
      } else
        k -= step;
      step = min(k, m - 1);
      if (step) ans.push_back({step, "L"});
      k -= step;
    }
    step = min(k, n - 1);
    if (step) ans.push_back({step, "U"});
  } else {
    step = min(k, n - 1);
    ans.push_back({step, "D"});
    k -= step;
    step = min(k, n - 1);
    if (step) ans.push_back({step, "U"});
    k -= step;
    for (int i = 1; k > 0 && i < m; ++i) {
      ans.push_back({1, "R"});
      k -= 1;
      step = min(k, 3 * (n - 1));
      if (step / 3) ans.push_back({step / 3, "DLR"});
      if (k == step) {
        k -= step / 3 * 3;
        if (k == 1)
          ans.push_back({1, "D"});
        else if (k == 2)
          ans.push_back({1, "DL"});
        k = 0;
      } else
        k -= step;
      step = min(k, n - 1);
      if (step) ans.push_back({step, "U"});
      k -= step;
    }
    step = min(k, m - 1);
    if (step) ans.push_back({step, "L"});
  }
  cout << ans.size() << endl;
  for (auto p : ans) {
    cout << p.first << " " << p.second << endl;
  }
}
