#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int N = 1e6 + 10;
const int M = 4e4 + 10;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int mod2 = 998244853;
vector<pair<int, string> > ans;
signed main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, m;
  long long k;
  cin >> n >> m >> k;
  long long mx = 4 * n * m - 2 * n - 2 * m;
  if (mx < k) {
    cout << "NO" << endl;
    return 0;
  }
  long long sum = 0;
  if (m > 1) {
    ans.emplace_back(make_pair(m - 1, "R"));
    sum += m - 1;
    ans.emplace_back(make_pair(m - 1, "L"));
    sum += m - 1;
  }
  for (int i = 2; i <= n; i++) {
    ans.emplace_back(make_pair(1, "D"));
    sum += 1;
    if (m > 1) {
      ans.emplace_back(make_pair(m - 1, "RUD"));
      sum += 3 * (m - 1);
      ans.emplace_back(make_pair(m - 1, "L"));
      sum += m - 1;
    }
  }
  if (n > 1) {
    ans.emplace_back(make_pair(n - 1, "U"));
    sum += n - 1;
  }
  while (1) {
    auto x = ans.back();
    ans.pop_back();
    if (sum - x.first * x.second.length() >= k) {
      sum -= x.first * x.second.length();
      continue;
    }
    sum -= x.first * x.second.length();
    long long cnt = k - sum;
    if (cnt / x.second.length())
      ans.emplace_back(make_pair(cnt / x.second.length(), x.second));
    if (cnt % x.second.length()) {
      ans.emplace_back(
          make_pair(1, x.second.substr(0, cnt % x.second.length())));
    }
    break;
  }
  cout << "YES" << endl;
  cout << ans.size() << endl;
  for (auto &x : ans) {
    cout << x.first << " " << x.second << endl;
  }
  return 0;
}
