3 8
2 4 4 4
7 2 5 2
6 5 6 3
20
3 2 U 1000000
3 2 U 1
3 2 U 2
3 2 U 3
3 2 U 4
3 2 U 5
3 2 U 6
3 2 U 7
3 2 U 8
3 2 U 9
3 2 U 10
3 2 U 11
3 2 U 12
3 2 U 13
3 2 U 14
3 2 U 15
3 2 U 16
3 2 U 17
3 2 U 18
3 2 U 19
 4 2
0 0 1 0
2 0 2 1
2 2 1 2
0 2 0 1
15
1 1 R 7
0 0 U 3
1 1 R 888888888888887
0 0 U 404040404040403
2 1 D 1000000000000000
2 0 R 324354768576473
2 0 L 325436475453245
2 0 U 764536452343654
2 0 D 943654765876545
1 1 U 1000000000000000
1 1 D 989898789898789
1 1 L 123456787654344
0 1 L 0
0 1 L 1
0 1 L 999999999999993
 1 10
1 5 9 5
1
5 5 L 1
 3 7
2 4 2 7
4 7 4 6
7 3 5 3
10
6 7 L 1
6 7 L 2
6 7 L 3
6 7 L 4
6 7 L 5
6 7 L 6
6 7 L 7
6 7 L 8
6 7 L 9
6 7 L 10

                                                               0                                                                2
                                                               3                                                                3
                                                               3                                                                4
                                                               4                                                                4
                                                               5                                                                4
                                                               6                                                                4
                                                               6                                                                3
                                                               6                                                                2
                                                               5                                                                2
                                                               4                                                                2
                                                               3                                                                2
                                                               2                                                                2
                                                               1                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                               0                                                                2
                                                                1                                                                0
                                                               2                                                                1
                                                               1                                                                0
                                                               2                                                                1
                                                               2                                                                1
                                                               2                                                                1
                                                               0                                                                1
                                                               0                                                                0
                                                               2                                                                1
                                                               2                                                                2
                                                               1                                                                2
                                                               0                                                                2
                                                               0                                                                1
                                                               0                                                                0
                                                               0                                                                0
                                                                6                                                                5
                                                                5                                                                7
                                                               4                                                                7
                                                               4                                                                6
                                                               4                                                                5
                                                               4                                                                4
                                                               4                                                                3
                                                               4                                                                2
                                                               4                                                                1
                                                               4                                                                0
                                                               4                                                                0

#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int Q = ((int)1e5) + 5;
const int INF = 0x7F7F7F7F;
const long long LINF = 0x7F7F7F7F7F7F7F7Fll;
const double eps = 1e-6;
const int mod = 1e9 + 7;
const double pi = acos(-1);
int B, q, b, n;
long long t[Q];
int ans[Q];
int dx[4] = {0, 0, -1, 1};
int dy[4] = {1, -1, 0, 0};
struct Node {
  int x, y, k;
  Node(int _x = 0, int _y = 0, int _k = 0) : x(_x), y(_y), k(_k) {
    if (k == 'U') k = 0;
    if (k == 'D') k = 1;
    if (k == 'L') k = 2;
    if (k == 'R') k = 3;
  }
  Node nxt() {
    int _x = x + dx[k];
    _x = max(0, _x);
    _x = min(_x, b);
    int _y = y + dy[k];
    _y = max(0, _y);
    _y = min(_y, b);
    return Node(_x, _y, k);
  }
  int id() { return (x * B + y) * 4 + k; }
} nxt[N * N * 4];
int to[2][N * N * 4];
int main() {
  freopen("in.txt", "r", stdin);
  scanf("%d%d", &n, &b);
  B = b + 1;
  for (int i = 0; i < B; ++i)
    for (int j = 0; j < B; ++j)
      for (int k = 0; k < 4; ++k) {
        Node a = Node(i, j, k);
        nxt[a.id()] = a.nxt();
      }
  for (int i = 0; i < n; ++i) {
    int x1, x2, y1, y2, d;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    if (x1 == x2)
      if (y2 > y1)
        d = 0;
      else
        d = 1;
    else if (x2 < x1)
      d = 2;
    else
      d = 3;
    int len = abs(y2 - y1) + abs(x2 - x1);
    for (int j = 0; j < len + 1; ++j) {
      int x, y;
      x = x1 + dx[d] * j;
      y = y1 + dy[d] * j;
      for (int k = 0; k < 4; ++k)
        nxt[Node(x, y, k).id()] = nxt[Node(x, y, d).id()];
    }
  }
  scanf("%d", &q);
  for (int i = 0; i < q; ++i) {
    int x, y;
    char ch;
    long long t0;
    scanf("%d %d %c %lld", &x, &y, &ch, t + i);
    ans[i] = Node(x, y, ch).id();
  }
  int ALL = 4 * B * B;
  for (int i = 0; i < ALL; ++i) to[0][i] = nxt[i].id();
  for (int i = 0; i < 50; ++i) {
    for (int j = 0; j < q; ++j)
      if (t[j] & (1ll << i)) ans[j] = to[0][ans[j]];
    for (int j = 0; j < ALL; ++j) to[1][j] = to[0][to[0][j]];
    for (int j = 0; j < ALL; ++j) to[0][j] = to[1][j];
  }
  for (int i = 0; i < q; ++i) {
    int x, y;
    x = ans[i] / 4 / B;
    y = ans[i] / 4 % B;
    printf("%d %d\n", x, y);
  }
}
