#include using namespace std; long long n, k, s, w, z, x, y, r, e, t, k3, a, b; double s2 = 1.41421356237; bool check(int p, int o) { return (p >= 1) && (p <= n) && o >= 1 && o <= n; } int main() { freopen("cleanUP.in", "r", stdin); freopen("cleanUP.out", "w", stdout); cin >> n >> k >> s >> w >> z >> x >> y; e = x; t = y; double tmp = (n - 1) * sqrt(2); k3 = floor(tmp) + 1; for(long long i = 0; i < k3; i++)scanf("%d", &z); for(long long i = 0; i < k; i++)cin >> a >> b; for(int i = 1; i <= s; i++) { do { r = (rand() + i) % 4; if(r == 0)e = x + 1; if(r == 1)e = x - 1; if(r == 2)t = y + 1; if(r == 3)t = y - 1; } while(check(e, t) == 0); if(x == e + 1)cout << "U"; if(x == e - 1)cout << "D"; if(y == t + 1)cout << "L"; if(y == t - 1)cout << "R"; x = e; y = t; } cout << endl; return 0; } /* 10 2 15 2 1 6 1 8 10 8 1 6 6 4 1 2 6 8 2 7 4 2 3 2 */