Problem: This is an interactive problem.

Alice and Bob are playing a game on the chessboard of size n × m where n and m are even. The rows are numbered from 1 to n and the columns are numbered from 1 to m. There are two knights on the chessboard. A white one initially is on the position (x_1, y_1), while the black one is on the position (x_2, y_2). Alice will choose one of the knights to play with, and Bob will use the other one.

The Alice and Bob will play in turns and whoever controls the white knight starts the game. During a turn, the player must move their knight adhering the chess rules. That is, if the knight is currently on the position (x, y), it can be moved to any of those positions (as long as they are inside the chessboard):

(x+1, y+2), (x+1, y-2), (x-1, y+2), (x-1, y-2),

(x+2, y+1), (x+2, y-1), (x-2, y+1), (x-2, y-1). 

We all know that knights are strongest in the middle of the board. Both knight have a single position they want to reach: 

  * the owner of the white knight wins if it captures the black knight or if the white knight is at (n/2, m/2) and this position is not under attack of the black knight at this moment; 
  * The owner of the black knight wins if it captures the white knight or if the black knight is at (n/2+1, m/2) and this position is not under attack of the white knight at this moment. 



Formally, the player who captures the other knight wins. The player who is at its target square ((n/2, m/2) for white, (n/2+1, m/2) for black) and this position is not under opponent's attack, also wins.

A position is under attack of a knight if it can move into this position. Capturing a knight means that a player moves their knight to the cell where the opponent's knight is.

If Alice made 350 moves and nobody won, the game is a draw.

Alice is unsure in her chess skills, so she asks you for a help. Choose a knight and win the game for her. It can be shown, that Alice always has a winning strategy.

Interaction

The interaction starts with two integers n and m (6 ≤ n,m ≤ 1000, n and m are even) — the dimensions of the chessboard.

The second line contains four integers x_1, y_1, x_2, y_2 (1 ≤ x_1, x_2 ≤ n, 1 ≤ y_1, y_2 ≤ m) — the positions of the white and the black knight. It is guaranteed that the two knights have different starting positions. It is also guaranteed that none of the knights are in their own target square in the beginning of the game (however, they can be on the opponent's target position).

Your program should reply with either "WHITE" or "BLACK", depending on the knight you want to play with. In case you select the white knight, you start the game.

During every your turn, you need to print two integers: x and y, the position to move the knight. If you won the game by this turn, you must terminate your program immediately.

After every turn of the opponent, you will receive two integers: x and y, the position where Bob moved his knight.

If your last move was illegal or you lost the game after jury's turn, or you made 350 moves, and haven't won, you will receive "-1 -1". In such cases, you should terminate your program and then you will get a Wrong Answer verdict.

After printing anything, do not forget to output the end of line and flush the output. Otherwise, you might get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



Hacks are disabled for this problem.

Jury's program is adaptive: the moves of jury may depend on the moves made by your program.

Examples

Input


8 8
2 3 1 8


Output


WHITE
4 4


Input


6 6
4 4 2 2
6 3

Output


BLACK
4 3

Note

In the first example, the white knight can reach it's target square in one move.

In the second example black knight wins, no matter what white knight moves.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int STEP[8][2] = {{1, 2},  {2, 1},  {-1, 2},  {-2, 1},
                        {1, -2}, {2, -1}, {-1, -2}, {-2, -1}};
int N, M;
int dep[2][1003][1003];
inline void bfs(int x, int y, int flag) {
  dep[flag][x][y] = 1;
  queue<pair<int, int> > que;
  que.push(pair<int, int>(x, y));
  while (!que.empty()) {
    pair<int, int> u = que.front();
    que.pop();
    for (int i = 0; i < 8; ++i) {
      x = u.first + STEP[i][0];
      y = u.second + STEP[i][1];
      if (x >= 1 && y >= 1 && x <= N && y <= M && dep[flag][x][y] == 0) {
        dep[flag][x][y] = dep[flag][u.first][u.second] + 1;
        que.push(pair<int, int>(x, y));
      }
    }
  }
}
inline bool canMove(int x1, int y1, int x2, int y2) {
  x1 = abs(x1 - x2);
  y1 = abs(y1 - y2);
  if (x1 == 1 && y1 == 2) return 1;
  if (x1 == 2 && y1 == 1) return 1;
  return 0;
}
inline long long dist(int x, int y, int x1, int y1) {
  return abs(x - x1) + abs(y - y1);
}
int ok[2][1003][1003];
int ddd[2][1003][1003];
int dfs(int x, int y, int flag) {
  if (flag == 0 && canMove(x, y, (N >> 1) + 1, M >> 1)) return 1;
  if (flag == 1 && canMove(x, y, (N >> 1), M >> 1)) return 1;
  ok[flag][x][y] = -1;
  for (int i = 0; i < 8; ++i) {
    int xx = x + STEP[i][0];
    int yy = y + STEP[i][1];
    if (xx >= 1 && yy >= 1 && xx <= N && yy <= M && ok[flag][xx][yy] == 0) {
      if (dep[flag][xx][yy] < dep[flag][x][y] &&
          dep[flag ^ 1][xx][yy] < dep[flag ^ 1][x][y]) {
        if (dfs(xx, yy, flag) == 1) {
          ok[flag][x][y] = 1;
        }
      }
    }
  }
  return ok[flag][x][y];
}
bool haveD = 1;
inline int change(int x, int flag) {
  if (flag) return x - 1;
  return x + 1;
}
inline int getNext(int x, int y, int x1, int y1, int flag, int& ansx, int& ansy,
                   int x2, int y2) {
  if (canMove(x, y, x2, y2)) {
    ansx = x2;
    ansy = y2;
    return 1;
  }
  if (canMove(x, y, x1, y1) && canMove(x2, y2, x1, y1)) {
    assert(1 == 0);
  }
  ansx = ansy = -1;
  for (int i = 0; i < 8; ++i) {
    int xx = x + STEP[i][0];
    int yy = y + STEP[i][1];
    if (xx >= 1 && yy >= 1 && xx <= N && yy <= M) {
      if (xx == x1 && yy == y1 && !canMove(x2, y2, x1, y1)) {
        ansx = xx;
        ansy = yy;
        break;
      }
      if (dep[flag ^ 1][x2][y2] == 2) {
        if (!canMove(xx, yy, change(x1, flag), y1)) {
          continue;
        } else if (ansx == -1) {
          ansx = xx;
          ansy = yy;
        }
      }
    }
    if (xx >= 1 && yy >= 1 && xx <= N && yy <= M && !canMove(xx, yy, x2, y2)) {
      if (haveD) {
        if (dep[flag][xx][yy] < dep[flag][x][y]) {
          if (ansx == -1 || ddd[flag][xx][yy] < ddd[flag][ansx][ansy]) {
            ansx = xx;
            ansy = yy;
          }
        }
      } else {
        if (dep[flag ^ 1][xx][yy] < dep[flag ^ 1][x][y]) {
          ansx = xx;
          ansy = yy;
        }
      }
    }
  }
  assert(ansx != -1);
  return dep[flag][x][y] == 2;
}
int haveto = 0;
inline int getChose(int x1, int y1, int x2, int y2) {
  if (x1 == x2 && y1 == y2) return 0;
  int chose = -1;
  if (canMove(x1, y1, x2, y2))
    chose = 0;
  else {
    if (dep[0][x1][y1] >= dep[0][x2][y2] &&
        (dep[0][x1][y1] - dep[0][x2][y2]) % 2 == 0)
      chose = 1;
    if (dep[1][x2][y2] >= dep[1][x1][y1] - 1 &&
        (dep[1][x2][y2] - dep[1][x1][y1] + 1) % 2 == 0) {
      if (chose != -1) {
        cerr << "NO1 " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
      }
      chose = 0;
    }
    if (chose != -1) {
      haveto = 1;
      if (dep[chose][x1][y1] == dep[chose][x2][y2])
        ;
      else
        haveD = 1;
      cerr << dep[0][x1][y1] << ' ' << dep[0][x2][y2] << endl;
      cerr << dep[1][x1][y1] << ' ' << dep[1][x2][y2] << endl;
      if (chose == 0) {
        if (dep[0][x1][y1] > dep[1][x2][y2]) {
        }
      } else {
        if (dep[0][x1][y1] <= dep[1][x2][y2]) {
        }
      }
    }
    if (chose == -1) {
      haveD = 1;
      if (dep[0][x1][y1] <= dep[1][x2][y2])
        chose = 0;
      else
        chose = 1;
    }
  }
  if (chose == -1) {
    cerr << "NO2 " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
  }
  return chose;
}
void bfs2(int chose) {
  int x, y;
  if (chose)
    x = N >> 1, y = M >> 1;
  else
    x = (N >> 1) + 1, y = M >> 1;
  queue<pair<int, int> > que;
  for (int i = 0; i < 8; ++i) {
    int xx = x + STEP[i][0];
    int yy = y + STEP[i][1];
    if (dep[chose][xx][yy] == 3) {
      ddd[chose][xx][yy] = 1;
      que.push(pair<int, int>(xx, yy));
    }
  }
  while (!que.empty()) {
    pair<int, int> u = que.front();
    que.pop();
    for (int i = 0; i < 8; ++i) {
      x = u.first + STEP[i][0];
      y = u.second + STEP[i][1];
      if (x >= 1 && y >= 1 && x <= N && y <= M && ddd[chose][x][y] == 0) {
        ddd[chose][x][y] = ddd[chose][u.first][u.second] + 1;
        que.push(pair<int, int>(x, y));
      }
    }
  }
}
int main() {
  scanf("%d %d", &N, &M);
  bfs(N >> 1, M >> 1, 0);
  bfs((N >> 1) + 1, M >> 1, 1);
  int x1, y1, x2, y2;
  scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
  int chose = getChose(x1, y1, x2, y2);
  if (chose == 0)
    puts("WHITE");
  else
    puts("BLACK");
  fflush(stdout);
  if (chose) scanf("%d %d", &x1, &y1);
  bfs2(chose);
  int x, y;
  for (int i = 0; i < 360; ++i) {
    int have = 0;
    if (chose == 0) {
      have = getNext(x1, y1, N >> 1, M >> 1, 0, x, y, x2, y2);
      x1 = x;
      y1 = y;
    } else {
      have = getNext(x2, y2, (N >> 1) + 1, M >> 1, 1, x, y, x1, y1);
      x2 = x;
      y2 = y;
    }
    printf("%d %d\n", x, y);
    fflush(stdout);
    if (x < 1 || y < 1 || x > N || y > M) assert(1 == 0);
    if (x1 == x2 && y1 == y2) break;
    if ((x1 == (N >> 1)) && (y1 == (M >> 1)) &&
        !canMove(x2, y2, N >> 1, M >> 1))
      break;
    if ((x2 == (N >> 1) + 1) && (y2 == (M >> 1)) &&
        !canMove(x1, y1, (N >> 1) + 1, M >> 1))
      break;
    if (chose == 0)
      scanf("%d %d", &x2, &y2);
    else
      scanf("%d %d", &x1, &y1);
    if (x1 == x2 && y1 == y2) assert(1 == 0);
    if ((x1 == (N >> 1)) && (y1 == (M >> 1)) &&
        !canMove(x2, y2, N >> 1, M >> 1))
      assert(1 == 0);
    if ((x2 == (N >> 1) + 1) && (y2 == (M >> 1)) &&
        !canMove(x1, y1, (N >> 1) + 1, M >> 1))
      assert(1 == 0);
    if (x1 == -1 || x2 == -1) {
      if (haveto) assert(1 == 0);
    }
    if (have) break;
    if (i > 355)
      while (1)
        ;
  }
  return 0;
}