#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 3e5 + 5;
long long powm(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long pow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}
signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  long long mx = n * m * 4 - 2 * n - 2 * m;
  if (k > mx) {
    cout << "NO" << '\n';
    return 0;
  }
  vector<long long> ans;
  vector<string> s;
  long long i = 0, j = 0, h = 0, v = 0;
  while (k > 0) {
    if (!v) {
      if (n > 1) {
        string t = "D";
        s.push_back(t);
        ans.push_back(min(k, n - 1));
        k -= min(k, n - 1);
      }
      v = 1;
    } else {
      if (j != m - 1) {
        if (n > 1) {
          string t = "U";
          s.push_back(t);
          ans.push_back(min(k, n - 1));
          k -= min(k, n - 1);
        }
        if (k > 0) {
          string t = "R";
          s.push_back(t);
          ans.push_back(1);
          j++;
          k--;
        }
        v = 0;
      } else {
        if (!h) {
          if (m > 1) {
            string t = "L";
            s.push_back(t);
            ans.push_back(min(k, m - 1));
            k -= min(k, m - 1);
          }
          h = 1;
        } else {
          if (m > 1) {
            string t = "R";
            s.push_back(t);
            ans.push_back(min(k, m - 1));
            k -= min(k, m - 1);
          }
          h = 0;
          if (k > 0) {
            string t = "U";
            s.push_back(t);
            ans.push_back(1);
            k--;
          }
        }
      }
    }
  }
  cout << "YES" << '\n';
  cout << (long long)ans.size() << '\n';
  for (long long i = 0; i < (long long)ans.size(); i++) {
    cout << ans[i] << ' ' << s[i] << '\n';
  }
}
