#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (x == 0) return y;
  return gcd(y % x, x);
}
long long powmod(long long x, long long y, long long m) {
  long long ans = 1, r = 1;
  x %= m;
  while (r > 0 && r <= y) {
    if (r & y) {
      ans *= x;
      ans %= m;
    }
    r <<= 1;
    x *= x;
    x %= m;
  }
  return ans;
}
long long mul_inv(long long a, long long b) {
  long long b0 = b, t, q;
  long long x0 = 0ll, x1 = 1ll;
  if (b == 1ll) return 1ll;
  while (a > 1ll) {
    q = a / b;
    t = b, b = a % b, a = t;
    t = x0, x0 = x1 - q * x0, x1 = t;
  }
  if (x1 < 0ll) x1 += b0;
  return x1;
}
bool bdec(long long &x, long long &y) { return x > y; }
vector<vector<long long>> id(long long n) {
  vector<vector<long long>> temp;
  temp.resize(n);
  for (int i = 0; i < n; i++) {
    temp[i].resize(n);
    temp[i][i] = 1;
  }
  return temp;
}
vector<vector<long long>> mul(vector<vector<long long>> &x,
                              vector<vector<long long>> &y) {
  long long a = x.size(), b = x[0].size(), c = y.size(), d = y[0].size();
  vector<vector<long long>> ans;
  if (b != c) {
    cout << "invalid\n";
    exit(0);
  }
  ans.resize(a);
  for (int i = 0; i < a; i++) {
    ans[i].resize(d);
    for (int k = 0; k < b; k++) {
      for (int t = 0; t < d; t++) {
        ans[i][t] += x[i][k] * y[k][t];
        ans[i][t] %= 1000000007;
      }
    }
  }
  return ans;
}
vector<vector<long long>> powmat(vector<vector<long long>> x, long long n,
                                 long long m) {
  vector<vector<long long>> ans = id(x.size());
  while (n > 0) {
    if (n & 1ll) {
      ans = mul(ans, x);
    }
    x = mul(x, x);
    n >>= 1ll;
  }
  return ans;
}
const long long maxn = 2e5 + 2;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, k;
  cin >> n >> m >> k;
  long long to = 4 * n * m - 2 * n - 2 * m;
  if (k > to) {
    cout << "NO";
    exit(0);
  }
  vector<pair<string, long long>> ans;
  vector<pair<string, long long>> meow;
  for (int i = 0; i < n; i++) {
    string move = "R";
    if (i % 2 != 0) move = "L";
    for (int t = 0; t < m - 1; t++) {
      if (i != n - 1) {
        meow.push_back({"D", 1});
        meow.push_back({"U", 1});
        meow.push_back({move, 1});
      } else {
        meow.push_back({move, 1});
      }
    }
    if (i != n - 1) {
      meow.push_back({"DU" + move, m + 10});
    } else {
      meow.push_back({move, m + 10});
    }
    if (i != n - 1) {
      meow.push_back({"D", 1});
    }
  }
  for (long long i = n - 1; i >= 0; i--) {
    string move = "L";
    if (i % 2 != 0) move = "R";
    for (int t = 0; t < m - 1; t++) {
      meow.push_back({move, 1});
    }
    meow.push_back({move, m + 10});
    if (i != 0) {
      meow.push_back({"U", 1});
    }
  }
  long long cnt = 0;
  for (long long i = 0; meow.size(); i++) {
    if (meow[i].second == 0) continue;
    if (cnt == k) break;
    if (meow[i].second == 1) {
      ans.push_back(meow[i]);
      cnt++;
    } else {
      long long h = meow[i].first.size() * (meow[i].second - 11);
      for (int t = 0; t < h; t++) {
        ans.pop_back();
      }
      if (h > 0) {
        ans.push_back({meow[i].first, meow[i].second - 11});
      }
    }
  }
  cout << "YES\n";
  cout << ans.size() << "\n";
  for (auto x : ans) {
    cout << x.second << " " << x.first << "\n";
  }
  return 0;
}
