#include <bits/stdc++.h>
using namespace std;
const long long MN = 505;
long long n, m, k;
int32_t main() {
  cin.tie(0), cin.sync_with_stdio(0);
  cin >> n >> m >> k;
  long long roads = 4 * n * m - 2 * n - 2 * m;
  if (k > roads) return 0 * printf("NO\n");
  vector<pair<long long, long long> > v;
  for (long long i = 1; i < n; i++) {
    if (m > 1) v.push_back({m - 1, 3});
    if (m > 1) v.push_back({m - 1, 2});
    v.push_back({1, 1});
  }
  if (m > 1) v.push_back({m - 1, 3});
  for (long long i = 1; i < m; i++) {
    if (n > 1) v.push_back({n - 1, 0});
    if (n > 1) v.push_back({n - 1, 1});
    v.push_back({1, 2});
  }
  if (n > 1) v.push_back({n - 1, 0});
  printf("YES\n");
  vector<pair<long long, long long> > out;
  for (long long i = 0; i < v.size(); i++) {
    if (k > v[i].first)
      k -= v[i].first, out.push_back(v[i]);
    else {
      out.push_back({k, v[i].second});
      break;
    }
  }
  printf("%lld\n", out.size());
  for (pair<long long, long long> p : out) {
    printf("%d ", p.first);
    if (p.second == 0) printf("U\n");
    if (p.second == 1) printf("D\n");
    if (p.second == 2) printf("L\n");
    if (p.second == 3) printf("R\n");
  }
  return 0;
}
