#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const long long MOD2 = 998244353;
const long long N = 2005;
const long long N2 = 70;
const long double PI = 3.141592653589793;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long power(long long x, long long y, long long p = LLONG_MAX) {
  long long res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  long long maximum = 4 * n * m - 2 * n - 2 * m;
  if (k > maximum)
    cout << "NO"
         << "\n";
  else {
    cout << "YES"
         << "\n";
    std::vector<pair<long long, string>> ans;
    vector<string> v;
    v.push_back("R");
    v.push_back("DUL");
    for (long long i = 1; i < n; ++i) {
      if (k > (m - 1) && m != 1) {
        k -= (m - 1);
        ans.push_back(make_pair(m - 1, v[0]));
      } else if (m != 1 && k) {
        ans.push_back(make_pair(k, v[0]));
        k = 0;
        break;
      }
      if (m != 1) {
        long long times = k / 3;
        if (times >= (m - 1)) {
          k -= (3 * (m - 1));
          ans.push_back(make_pair(m - 1, v[1]));
        } else {
          k -= (times * 3);
          if (times) ans.push_back(make_pair(times, v[1]));
          if (k == 2) {
            k -= 2;
            ans.push_back(make_pair(1, "DU"));
          } else if (k == 1) {
            k -= 1;
            ans.push_back(make_pair(1, "D"));
          }
          if (!k) break;
        }
      }
      if (k) {
        ans.push_back(make_pair(1, "D"));
        k--;
      }
    }
    if (k > (m - 1) && m != 1) {
      k -= (m - 1);
      ans.push_back(make_pair(m - 1, v[0]));
    } else if (m != 1 && k) {
      ans.push_back(make_pair(k, v[0]));
      k = 0;
    }
    if (k > (m - 1) && m != 1) {
      k -= (m - 1);
      ans.push_back(make_pair(m - 1, "L"));
    } else if (m != 1 && k) {
      ans.push_back(make_pair(k, "L"));
      k = 0;
    }
    if (k) {
      ans.push_back(make_pair(k, "U"));
    }
    cout << ans.size() << "\n";
    for (auto x : ans) cout << x.first << " " << x.second << "\n";
  }
  cerr << "Time : " << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC
       << "ms\n";
  ;
  return 0;
}
