#include <bits/stdc++.h>
using namespace std;
void __print(long long x) { cout << x; }
void __print(long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cout << '{';
  __print(x.first);
  cout << ',';
  __print(x.second);
  cout << '}';
}
template <typename T>
void __print(const T &x) {
  long long f = 0;
  cout << '{';
  for (auto &i : x) cout << (f++ ? "," : ""), __print(i);
  cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cout << ", ";
  _print(v...);
}
long long __pow(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res *= x;
    y >>= 1;
    x *= x;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long t, n, m, k;
void solve() {
  cin >> n >> m >> k;
  if (k > 4 * n * m - 2 * n - 2 * m) {
    cout << "NO\n";
    ;
    return;
  }
  cout << "YES\n";
  ;
  vector<pair<long long, char>> a;
  long long N = n;
  for (; k > 0;) {
    if (k >= (m - 1) && N)
      a.push_back({m - 1, 'R'}), k -= (m - 1), N--;
    else if (k && N)
      a.push_back({k, 'R'}), k = 0, N--;
    if (k >= (m - 1) && N)
      a.push_back({m - 1, 'L'}), k -= (m - 1);
    else if (k && N)
      a.push_back({k, 'L'}), k = 0;
    if (k && N) a.push_back({1, 'D'}), k--;
    if (k >= (n - 1) && !N)
      a.push_back({n - 1, 'U'}), k -= (n - 1);
    else if (k && !N)
      a.push_back({k, 'U'}), k = 0;
    if (k >= (n - 1) && !N)
      a.push_back({n - 1, 'D'}), k -= (n - 1);
    else if (k && !N)
      a.push_back({k, 'D'}), k = 0;
    if (k && !N) a.push_back({1, 'L'}), k--;
  }
  long long ans = a.size();
  for (auto x : a)
    if (!x.first) ans--;
  cout << ans << endl;
  for (auto x : a)
    if (x.first) cout << x.first << " " << x.second << endl;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  t = 1;
  while (t--) solve();
}
