#include <bits/stdc++.h>
using namespace std;
long long spf[101];
long long fac[101];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 101; i++) spf[i] = i;
  for (long long i = 4; i < 101; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 101; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 101; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  if (k > 4 * n * m - 2 * n - 2 * m) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
  vector<pair<long long, string> > v;
  if (m == 1) {
    if (k >= n - 1) {
      k -= n - 1;
      v.push_back(make_pair(n - 1, "D"));
    } else {
      v.push_back(make_pair(k, "D"));
      k = 0;
    }
    if (k) v.push_back(make_pair(k, "U"));
    cout << v.size() << '\n';
    for (auto it : v) {
      cout << it.first << " " << it.second << '\n';
    }
    return;
  }
  string s1 = "DUR", s2 = "DUL";
  for (long long i = 1; i <= n - 1; i++) {
    if (k >= (m - 1) * 3) {
      k -= (m - 1) * 3;
      if (i % 2) {
        v.push_back(make_pair(m - 1, s1));
      } else
        v.push_back(make_pair(m - 1, s2));
    } else if (k) {
      long long temp = k / 3;
      if (i % 2 && temp) {
        v.push_back(make_pair(temp, s1));
      } else if (temp)
        v.push_back(make_pair(temp, s2));
      long long temp2 = k % 3;
      if (temp2 == 1)
        v.push_back(make_pair(1, "D"));
      else if (temp2 == 2)
        v.push_back(make_pair(1, "DU"));
      k = 0;
    }
    if (k) {
      v.push_back(make_pair(1, "D"));
      k--;
    }
  }
  if (k) {
    if (k >= m - 1) {
      k -= (m - 1);
      if (n % 2) {
        v.push_back(make_pair(m - 1, "R"));
      } else
        v.push_back(make_pair(m - 1, "L"));
    } else if (k) {
      if (n % 2) {
        v.push_back(make_pair(k, "R"));
      } else
        v.push_back(make_pair(k, "L"));
      k = 0;
    }
  }
  for (long long i = n; i >= 1 && k; i--) {
    if (k >= m - 1) {
      k -= (m - 1);
      if (i % 2) {
        v.push_back(make_pair(m - 1, "L"));
      } else
        v.push_back(make_pair(m - 1, "R"));
    } else if (k) {
      if (i % 2) {
        v.push_back(make_pair(k, "L"));
      } else
        v.push_back(make_pair(k, "R"));
      k = 0;
    }
    if (k) {
      v.push_back(make_pair(1, "U"));
      k--;
    }
  }
  cout << v.size() << '\n';
  for (auto it : v) {
    cout << it.first << " " << it.second << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
