#include <bits/stdc++.h>
using namespace std;
const int d[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1};
const double pi = acos(-1);
int Map[(2 * 500 + 10)][(2 * 500 + 10)], f[(2 * 500 + 10)][(2 * 500 + 10)],
    st[(2 * 500 + 10)][(2 * 500 + 10)], bfs[(2 * 500 + 10) * (2 * 500 + 10)];
int sx, sy, tx, ty, cnt, m;
vector<int> Go(int sx, int sy, int tx, int ty) {
  vector<int> tmp;
  int l, r;
  cnt++;
  f[sx][sy] = cnt;
  bfs[l = r = 1] = (sx << 20) + sy;
  while (l <= r) {
    int x = bfs[l] >> 20, y = bfs[l] - (x << 20);
    l++;
    if (x == tx && y == ty) {
      for (;;) {
        if (x == sx && y == sy) break;
        int v = st[x][y];
        tmp.push_back(v);
        x -= d[v][0];
        y -= d[v][1];
      }
      reverse(tmp.begin(), tmp.end());
      return tmp;
    }
    for (int i = 0; i <= 3; ++i) {
      int xx = x + d[i][0], yy = y + d[i][1];
      if (xx >= 0 && xx <= 2 * 500 && yy >= 0 && yy <= 2 * 500 &&
          !Map[xx][yy] && f[xx][yy] != cnt) {
        f[xx][yy] = cnt;
        bfs[++r] = (xx << 20) + yy;
        st[xx][yy] = i;
      }
    }
  }
  tmp.push_back(-1);
  return tmp;
}
void shadow_go(vector<int> q) {
  for (int i : q) {
    int x = tx + d[i][0], y = ty + d[i][1];
    if (x >= 0 && x <= 2 * 500 && y >= 0 && y <= 2 * 500 && Map[x][y]) continue;
    tx = x;
    ty = y;
  }
}
bool in(int x, int y) {
  if (x >= 500 - 250 && x <= 500 + 250 && y >= 500 - 250 && y <= 500 + 250)
    return 1;
  return 0;
}
char ch(int x) {
  if (x == 0) return 'L';
  if (x == 1) return 'U';
  if (x == 2) return 'R';
  return 'D';
}
void P(int x, int num) {
  for (int i = 1; i <= num; ++i) printf("%c", ch(x));
}
void back() {
  while (sx > -500 || sy > -500) {
    if ((sy < 500 - 120 || sy > 500 + 120) &&
        (ty < 500 - 120 || ty > 500 + 120)) {
      sx--;
      tx--;
      P(0, 1);
    }
    if ((sx < 500 - 120 || sx > 500 + 120) &&
        (tx < 500 - 120 || tx > 500 + 120)) {
      sy--;
      ty--;
      P(3, 1);
    }
  }
}
void work2() {
  back();
  if (ty > sy) {
    for (int y = 0; y <= 2 * 500; ++y)
      for (int x = 0; x <= 2 * 500; ++x)
        if (Map[x][y]) {
          P(2, x - tx);
          P(1, y - sy - 1);
          P(3, y - sy - 1);
          P(0, x - tx);
          ty = sy;
          goto A;
        }
  A:;
  }
  if (ty < sy) {
    for (int y = 2 * 500; y >= 0; --y)
      for (int x = 0; x <= 2 * 500; ++x)
        if (Map[x][y]) {
          P(1, y + 1 - ty);
          P(2, x - tx);
          P(3, sy - ty);
          P(1, sy - ty);
          P(0, x - tx);
          P(3, y + 1 - ty);
          ty = sy;
          goto B;
        }
  B:;
  }
  if (tx < sx) {
    for (int x = 2 * 500; x >= 0; --x)
      for (int y = 0; y <= 2 * 500; ++y)
        if (Map[x][y]) {
          P(2, x + 1 - tx);
          P(1, y - ty);
          P(0, sx - tx);
          P(2, sx - tx);
          P(3, y - ty);
          P(0, x + 1 - tx);
          tx = sx;
          goto C;
        }
  C:;
  }
  if (tx > sx) {
    for (int x = 0; x <= 2 * 500; ++x)
      for (int y = 0; y <= 2 * 500; ++y)
        if (Map[x][y]) {
          P(1, y - ty);
          P(2, x - 1 - sx);
          P(0, x - 1 - sx);
          P(3, y - ty);
          tx = sx;
          goto D;
        }
  D:;
  }
}
void work() {
  vector<int> q;
  for (;;) {
    q = Go(sx, sy, tx, ty);
    if (q[0] == -1) {
      printf("-1\n");
      return;
    }
    for (int i : q) printf("%c", ch(i));
    sx = tx;
    sy = ty;
    shadow_go(q);
    if (sx == tx && sy == ty) break;
    if (!in(sx, sy) && !in(tx, ty)) {
      work2();
      return;
    }
  }
}
int main() {
  scanf("%d%d%d%d%d", &sx, &sy, &tx, &ty, &m);
  if (!m) {
    puts("-1");
    return 0;
  }
  sx += 500;
  sy += 500;
  tx += 500;
  ty += 500;
  for (int i = 1; i <= m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    Map[x + 500][y + 500] = 1;
  }
  work();
}
