#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807;
const long long int mod = 998244353;
long long int max3(long long int a, long long int b, long long int c) {
  return max(c, max(a, b));
}
long long int min3(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
long long int power(long long int x, long long int y, long long int mod1) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod1;
    y = y >> 1;
    x = (x * x) % mod1;
  }
  return res;
}
long long int logg(long long int a) {
  long long int x = 0;
  while (a > 1) {
    x++;
    a /= 2;
  }
  return x;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int abso(long long int x) {
  if (x < 0) {
    return -x;
  }
  return x;
}
long long int ceiling(long long int a, long long int b) {
  if (a % b == 0) {
    return a / b;
  } else {
    return a / b + 1;
  }
}
long long int modinv(long long int x, long long int p) {
  return power(x, p - 2, p);
}
struct point {
  long long int x;
  long long int y;
};
long long int cross(point a, point b) { return a.x * b.y - b.x * a.y; }
bool ccw1(point p1, point p2) {
  if (cross(p1, p2) > 0) {
    return true;
  } else {
    return false;
  }
}
bool comp(point p1, point p2) {
  if (p1.x < p2.x) {
    return true;
  } else {
    if (p1.x > p2.x) {
      return false;
    } else {
      if (p1.y <= p2.y) {
        return true;
      }
      return false;
    }
  }
}
long long ccw(point p1, point p2, point p3) {
  long long int val =
      (p2.y - p1.y) * (p3.x - p2.x) - (p2.x - p1.x) * (p3.y - p2.y);
  return val;
}
void ccw_sort(vector<point> &v) {
  vector<point> v1, v2;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].y > 0) {
      v1.push_back(v[i]);
    } else {
      v2.push_back(v[i]);
    }
  }
  sort(v1.begin(), v1.end(), ccw1);
  sort(v2.begin(), v2.end(), ccw1);
  for (int i = 0; i < v2.size(); i++) {
    v1.push_back(v2[i]);
  }
  v = v1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  t = 1;
  while (t--) {
    long long int n, m;
    long long int k;
    cin >> n >> m >> k;
    if (k > 4 * n * m - 2 * n - 2 * m) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
      if (n == 1 && m == 1) {
        cout << 0 << endl;
        continue;
      }
      vector<pair<int, string>> ans;
      if (m == 1) {
        vector<pair<int, string>> v;
        for (int i = 0; i < n - 1; i++) {
          v.push_back(make_pair(1, "D"));
        }
        for (int i = 0; i < n - 1; i++) {
          v.push_back(make_pair(1, "U"));
        }
        for (int i = 0; i < v.size(); i++) {
          if (k == 0) {
            break;
          } else {
            if (v[i].first * (int)v[i].second.size() <= k) {
              ans.push_back(v[i]);
              k -= v[i].first * (int)v[i].second.size();
            } else {
              if (k / v[i].second.size() > 0) {
                ans.push_back(make_pair(k / v[i].second.size(), v[i].second));
              }
              string temp;
              for (int j = 0; j < k % (v[i].second.size()); j++) {
                temp.push_back(v[i].second[j]);
              }
              if (temp.size() > 0) {
                ans.push_back(make_pair(1, temp));
              }
              k = 0;
            }
          }
        }
        cout << ans.size() << endl;
        for (int i = 0; i < ans.size(); i++) {
          cout << ans[i].first << ' ' << ans[i].second << endl;
        }
        continue;
      }
      vector<pair<int, string>> v;
      int prev = 0;
      for (int i = 0; i < n; i++) {
        if (prev % 2 == 0) {
          v.push_back(make_pair(m - 1, "R"));
        } else {
          v.push_back(make_pair(m - 1, "L"));
        }
        if (i != n - 1) {
          v.push_back(make_pair(1, "D"));
        }
        prev++;
      }
      for (int i = 1; i < n; i++) {
        if (prev % 2 == 0) {
          v.push_back(make_pair(m - 1, "UDR"));
        } else {
          v.push_back(make_pair(m - 1, "UDL"));
        }
        v.push_back(make_pair(1, "U"));
        prev++;
      }
      v.push_back(make_pair(m - 1, "L"));
      for (int i = 0; i < v.size(); i++) {
        if (k == 0) {
          break;
        } else {
          if (v[i].first * (int)v[i].second.size() <= k) {
            ans.push_back(v[i]);
            k -= v[i].first * (int)v[i].second.size();
          } else {
            if (k / v[i].second.size() > 0) {
              ans.push_back(make_pair(k / v[i].second.size(), v[i].second));
            }
            string temp;
            for (int j = 0; j < k % (v[i].second.size()); j++) {
              temp.push_back(v[i].second[j]);
            }
            if (temp.size() > 0) {
              ans.push_back(make_pair(1, temp));
            }
            k = 0;
          }
        }
      }
      cout << ans.size() << endl;
      for (int i = 0; i < ans.size(); i++) {
        cout << ans[i].first << ' ' << ans[i].second << endl;
      }
      continue;
    }
  }
}
