Ruudukko

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

#define y first
#define x second

using namespace std;

bool check_small(int h, int w, int y0, int x0, int y1, int x1) {
	if (x0 > x1 || (x0 == x1 && y0 > y1)) return check_small(h, w, y1, x1, y0, x0);
 
	if (h == 1) {
		if (x0 == 0 && x1 == w-1) return true;
		if (x0 == w-1 && x1 == 0) return true;
		return false;
	} else {
		if (x0 == x1 && 0 < x0 && x0 < w-1) return false;
		return true;
	}
}

bool works(int h, int w, int y0, int x0, int y1, int x1) {
	if (y0 == y1 && x0 == x1) return false;
	if (w < h) return works(w, h, x0, y0, x1, y1);
	if (! ((h*w ^ abs(x0 - x1) ^ abs(y0 - y1)) & 1)) return false;
	if ((h*w & 1) && ((x0 + y0) & 1)) return false;
 
	if (h <= 2) return check_small(h, w, y0, x0, y1, x1);
	if (h == 3 && (!(w & 1))) {
		if (y0 == 1) {
			if ((x0 & 1) && x1 < x0) return false;
			if (!(x0 & 1) && x1 > x0) return false;
		} else {
			if (!(x0 & 1) && (x1 < x0 - 1)) return false;
			if ((x0 & 1) && (x1 > x0 + 1)) return false;
		}
	}   
	return true;
}

bool ok(int h, int w, pair<int, int> s, pair<int, int> t) {
    return works(h, w, s.y - 1, s.x - 1, t.y - 1, t.x - 1);
}

string rev(string s) {
    map<char, char> sw;
    sw['U'] = 'D';
    sw['D'] = 'U';
    sw['L'] = 'R';
    sw['R'] = 'L';

    string ans;
    for (char c : s) ans += sw[c];
    reverse(ans.begin(), ans.end());
    return ans;
}

pair<int, int> offset(pair<int, int> p, pair<int, int> off) {
    return {p.y + off.y, p.x + off.x};
}

// Assume s.y <= 2 and t.y >= n - 2
string solve(int n, int m, pair<int, int> s, pair<int, int> t) {
    if (s.y > 2) return solve(n - 2, m, offset(s, {-2, 0}), offset(t, {-2, 0}));
    if (t.y < n - 2) return solve(n - 2, m, s, t);
    if (n == 3) {
        // Solve for m
        return "";
    }
    if (n == 4 && m == 4) return "";

    int left_n = 2;
    int right_n = 2 + (n % 2);

    // Find a ok for this setup ignoring in between stuff

    int mid = n - left_n - right_n;

    for (int j = 1; j <= m; ++j) {
        pair<int, int> first_e = {left_n, j};
        pair<int, int> second_e = {1, j};

        if (ok(left_n, m, s, first_e) && ok(right_n, m, second_e, offset(t, {-(left_n + mid), 0}))) {
            return "";
        }
    }

    exit(-1);
}

void test_case() {
    int n, m;
    pair<int, int> s, t;

    cin >> n >> m >> s.y >> s.x >> t.y >> t.x;

    if (!ok(n, m, s, t)) {
        cout << "NO" << endl;
        return;
    }

    cout << "YES" << endl;
    //cout << n << " " << m << " " << s.y << " " << s.x << " " << t.y << " " << t.x << endl;
    string ans = s <= t ? solve(n, m, s, t) : rev(solve(n, m, t, s));
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; ++i) {
        test_case();
    }

    return 0;
}

/*


*/

Test 1

Group: 1, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 5

Verdict: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Test 5

Group: 5

Verdict: WRONG ANSWER

Test 6

Group: 5

Verdict: WRONG ANSWER

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

Test 8

Group: 2, 5

Verdict: RUNTIME ERROR

Test 9

Group: 3, 5

Verdict: WRONG ANSWER

Test 10

Group: 3, 5

Verdict: WRONG ANSWER

Test 11

Group: 3, 5

Verdict: WRONG ANSWER

Test 12

Group: 3, 5

Verdict: WRONG ANSWER

Test 13

Group: 4, 5

Verdict: WRONG ANSWER

Test 14

Group: 5

Verdict: WRONG ANSWER

Test 15

Group: 3, 5

Verdict: WRONG ANSWER

Test 16

Group: 5

Verdict: WRONG ANSWER