#include <bits/stdc++.h>

using namespace std;

string rep(string s, char U, char D, char L, char R) {
    for_each(s.begin(), s.end(), [&](char &x){ x += 'a' - 'A';});
    replace(s.begin(), s.end(), 'u', U), replace(s.begin(), s.end(), 'd', D);
    replace(s.begin(), s.end(), 'l', L), replace(s.begin(), s.end(), 'r', R);
    return s;
}

string rev(string s) {
    reverse(s.begin(), s.end()); return rep(s, 'D', 'U', 'R', 'L');
}

int calc(int n, int m, int a, int b, int c, int d) {
    if (n > m) return calc(m, n, b, a, d, c);
    if (a > c) return calc(n, m, n - a + 1, b, n - c + 1, d);
    if (b > d) return calc(n, m, a, m - b + 1, c, m - d + 1);
    if (a == c && b == d) return 0;
    if (n == 1) return abs(b - d);
    if (n == 2 && a != c && d - b <= 1) return max(b + d - 1, m + m - b - d + 1);
    if ((n * m) & 1) return n * m - 1 - ((a + b) & 1) - ((c + d) & 1);
    if (n == 3 && ((a + b + c + d) & 1) && ((d - b >= 2 && ((a + b) & 1)) || (a == 2 && c == 2 && (b & 1)))) return n * m - 3;
    return n * m - 1 - !((a + b + c + d) & 1);
}

void Nxt(int ty, int n, int m, int a, int b, int &c, int &d, char &dir) {
    c = a, d = b;
    if ((a == 1 && (b != (!ty ? m : 1))) || (a == n && (b != (!ty ? 1 : m)))) {
        if (ty ^ (a == 1)) ++d, dir = 'R';
        else --d, dir = 'L';
    } else {
        if (ty ^ (b == 1)) --c, dir = 'U';
        else ++c, dir = 'D';
    }
}

string Solve(int n, int m, int a, int b, int c, int d) {
    int V = calc(n, m, a, b, c, d);
    if (n > m) return rep(Solve(m, n, b, a, d, c), 'L', 'R', 'U', 'D');
    if (a > c) return rep(Solve(n, m, n - a + 1, b, n - c + 1, d), 'D', 'U', 'L', 'R');
    if (b > d) return rep(Solve(n, m, a, m - b + 1, c, m - d + 1), 'U', 'D', 'R', 'L');
    if (n == 1) return string(d - b, 'R');
    if (n == 2 && a != c && abs(b - d) <= 1) {
        if (b + d - 1 > m + m - b - d + 1) return string(b - 1, 'L') + "D" + string(d - 1, 'R');
        return string(m - b, 'R') + "D" + string(m - d, 'L');
    }
    for (int i = a; i < c; ++i) for (int j = 1; j <= m; ++j)
        if (calc(i, m, a, b, i, j) + calc(n - i, m, 1, j, c - i, d) + 1 == V)
            return Solve(i, m, a, b, i, j) + "D" + Solve(n - i, m, 1, j, c - i, d);
    for (int i = b; i < d; ++i) for (int j = 1; j <= n; ++j) 
        if (calc(n, i, a, b, j, i) + calc(n, m - i, j, 1, c, d - i) + 1 == V)
            return Solve(n, i, a, b, j, i) + "R" + Solve(n, m - i, j, 1, c, d - i);
    int f1 = (a == 1 || a == n || b == 1 || b == m), f2 = (c == 1 || c == n || d == 1 || d == m);
    if ((f1 || f2) && n > 3) {
        int fl = 0;
        if (!f1 && f2) swap(f1, f2), fl = 1, swap(a, c), swap(b, d);
        string S;
        int ty = (a == 1 && b == 2) || (a == 2 && b == m) || (a == n && b == m - 1) || (a == n - 1 && b == 1);
        int ta = a, tb = b;
        while (1) {
            int ox, oy; char dir;
            Nxt(ty, n, m, a, b, ox, oy, dir);
            if (ox == ta && oy == tb) {
                if (a == 1) ++a, S += "D";
                else if (a == n) --a, S += "U";
                else if (b == 1) ++b, S += "R";
                else --b, S += "L";
                break;
            }
            a = ox, b = oy, S += dir;
        }
        S += Solve(n - 2, m - 2, a - 1, b - 1, c - 1, d - 1);
        return fl ? rev(S) : S;
    }
    if (n != 3) {
        string S;
        int fl = !(n & 1);
        if (fl) swap(n, m), swap(a, b), swap(c, d);
        if (a > ((n + 1) >> 1)) return rep(Solve(n, m, n - a + 1, b, n - c + 1, d), 'D', 'U', 'L', 'R');
        S += string(a - 1, 'U');
        S += string(m - b, 'R');
        S += string(n - 1, 'D');
        S += string(m - 1, 'L');
        S += string(n - 1, 'U');
        S += "R";
        for (int i = 1; i <= (a >> 1); ++i) {
            S += string(b - 3, 'R') + "D" + string(b - 3, 'L') + "D";
        }
        for (int i = 1; i <= (m >> 1) - 1; ++i) {
            S += string(n - a - 2, 'D') + "R" + string(n - a - 2, 'U') + (i != (m >> 1) - 1 ? "R" : "U");
        }
        for (int i = 1; i <= ((m - b - 1) >> 1); ++i) {
            S += string(a - 2, 'U') + "L" + string(a - 2, 'D') + (i != ((m - b - 1) >> 1) ? "L" : "");
        }
        return fl ? rep(S, 'L', 'R', 'U', 'D') : S;
    }
    if (a == 3 || (a == 2 && c == 3)) return rev(rep(Solve(n, m, n - c + 1, m - d + 1, n - a + 1, m - b + 1), 'D', 'U', 'R', 'L'));
    if (a == 1 && b == d && calc(n, b - 1, 1, b - 1, c ^ 1, b - 1) + calc(n, m - b, c ^ 1, 1, c, 1) + 4 == V) {
        return "L" + Solve(n, b - 1, 1, b - 1, c ^ 1, b - 1) + "RR" + Solve(n, m - b, c ^ 1, 1, c, 1) + "L";
    }
    if (a == 1 && b == d && calc(n, m - b, 1, 1, c ^ 1, 1) + calc(n, b - 1, c ^ 1, b - 1, c, b - 1) + 4 == V) {
        return "R" + Solve(n, m - b, 1, 1, c ^ 1, 1) + "LL" + Solve(n, b - 1, c ^ 1, b - 1, c, b - 1) + "R";
    }
    string S;
    S += string(m - b, 'R');
    S += "D";
    for (int i = 1; i <= (m - b - 1) >> 1; ++i) S += "DLUL";
    S += "L";
    for (int i = 1; i <= (b - 1) >> 1; ++i) S += "LULD";
    S += "D";
    S += string(b, 'R');
    return S;
}

void printGrid(int n, int m, int a, int b, int c, int d, string S) {
    vector< vector<char> > z(n * 2, vector<char>(m * 3 - 1, ' '));
    z[a * 2 - 1][b * 3 - 2] = z[c * 2 - 1][d * 3 - 2] = '*';
    for (auto o : S) {
        if (o == 'R') z[a * 2 - 1][b * 3 - 1] = z[a * 2 - 1][b * 3] = '-', ++b;
        else if (o == 'L') --b, z[a * 2 - 1][b * 3 - 1] = z[a * 2 - 1][b * 3] = '-';
        else if (o == 'D') z[a * 2][b * 3 - 2] = '|', ++a;
        else --a, z[a * 2][b * 3 - 2] = '|';
    }
    for (int i = 1; i <= n * 2 - 1; ++i, puts("")) {
        for (int j = 1; j <= m * 3 - 2; ++j) putchar(z[i][j] != '*' && (i & 1) && (j % 3 == 1) ? 'o' : z[i][j]);
    }
}

signed main() {
    int type, T; scanf("%d%d", &type, &T);
    while (T--) {
        int n, m, a, b, c, d; scanf("%d%d%d%d%d%d", &n, &m, &a, &b, &c, &d);
        if (type != 0) printGrid(n, m, a, b, c, d, Solve(n, m, a, b, c, d));
        else printf("%d\n", calc(n, m, a, b, c, d) + 1);
    }
    return 0;
}