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 maxb = 32, logt = 29;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
int MaximGorky[logt][maxb * maxb * 4], n, b, q;
inline void setturn(int x, int y, int d) {
  int nx = max(0, min(b, x + dx[d])), ny = max(0, min(b, y + dy[d]));
  for (int w = 0; w < 4; w++)
    MaximGorky[0][(((x) << 7) | ((y) << 2) | w)] =
        (((nx) << 7) | ((ny) << 2) | d);
}
inline int go(int v, long long q) {
  for (int it = 0; it < logt; it++, q >>= 2)
    for (int j = 0; j < (q & 3); j++) v = MaximGorky[it][v];
  return v;
}
inline int getdir(char c) {
  if (c == 'U') return 0;
  if (c == 'R') return 1;
  if (c == 'D') return 2;
  return 3;
}
int main() {
  srand(time(0));
  scanf("%d%d", &n, &b);
  for (int i = 0; i <= b; i++)
    for (int j = 0; j <= b; j++)
      for (int d = 0; d < 4; d++) {
        int nx = max(0, min(b, i + dx[d])), ny = max(0, min(b, j + dy[d]));
        MaximGorky[0][(((i) << 7) | ((j) << 2) | d)] =
            (((nx) << 7) | ((ny) << 2) | d);
      }
  for (int i = 0; i < n; i++) {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    if (x1 == x2)
      for (int y = min(y1, y2); y <= max(y1, y2); y++)
        setturn(x1, y, y1 < y2 ? 0 : 2);
    else
      for (int x = min(x1, x2); x <= max(x1, x2); x++)
        setturn(x, y1, x1 < x2 ? 1 : 3);
  }
  for (int it = 1; it < logt; it++)
    for (int x = 0; x < maxb * maxb * 4; x++) {
      MaximGorky[it][x] = MaximGorky[it - 1][x];
      for (int j = 0; j < 3; j++)
        MaximGorky[it][x] = MaximGorky[it - 1][MaximGorky[it][x]];
    }
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int x, y;
    char d;
    long long t;
    cin >> x >> y >> d >> t;
    int res = go((((x) << 7) | ((y) << 2) | getdir(d)), t);
    printf("%d %d\n", res >> 7, (res >> 2) & 31);
  }
  return 0;
}
