Problem:
Score : 200 points

Problem Statement

Our world is one-dimensional, and ruled by two empires called Empire A and Empire B.

The capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.

One day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.

If there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.

X < Z \leq Y

x_1, x_2, ..., x_N < Z

y_1, y_2, ..., y_M \geq Z

Determine if war will break out.

Constraints

All values in input are integers.

1 \leq N, M \leq 100

-100 \leq X < Y \leq 100

-100 \leq x_i, y_i \leq 100

x_1, x_2, ..., x_N \neq X

x_i are all different.

y_1, y_2, ..., y_M \neq Y

y_i are all different.

Input

Input is given from Standard Input in the following format:

N M X Y
x_1 x_2 ... x_N
y_1 y_2 ... y_M

Output

If war will break out, print War; otherwise, print No War.

Sample Input 1

3 2 10 20
8 15 13
16 22

Sample Output 1

No War

The choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.

X = 10 < 16 \leq 20 = Y

8, 15, 13 < 16

16, 22 \geq 16

Sample Input 2

4 2 -48 -1
-20 -35 -91 -23
-22 66

Sample Output 2

War

Sample Input 3

5 3 6 8
-10 3 1 5 -100
100 6 14

Sample Output 3

War

Solution in JavaScript (node.js v5.12) (judge verdict: Runtime Error)

let lines = [];
let reader = require('readline').createInterface({
  input: process.stdin,
  output: process.stdout
});

reader.on('line', function(line){
  lines.push(line.split(" "));
})

reader.on('close', function(){
  console.log(lines)
  if(happensWars(lines)) console.log("War");
  else console.log("No War");
})

//1行目に[N,M,X,Y]
//（
//Nは最低いくつ支配下に置くか、
//Mが最大いくつ支配下に置くか、
//XがA帝国の現在の座標
//YがB帝国の現在の座標
//）
//2行目にA帝国が支配下に置きたい座標の配列
//3行目にB帝国が支配下に置きたい座標の配列
function happensWars(coordinates){
  // A帝国の希望する最大の座標
  let maxOfA = -100;
  // B帝国の希望する最小の座標
  let minOfB = 100;

  const coordinateA = coordinates[0][2];
  const coordinateB = coordinates[0][3];

  coordinates[1].map((num) => {
    const coordinateX = Number(num);
    if(maxOfA < coordinateX) {
      maxOfA = coordinateX;
    }
  })

  coordinates[2].map((num) => {
    const coordinateY = Number(num);
    if(minOfB > coordinateY) {
      minOfB = coordinateY;
    }
  })

//  console.log(`Aの座標は${coordinateA},希望地の最大座標は${maxOfA}`);
//  console.log(`Bの座標は${coordinateB},希望地の最小座標は${minOfB}`);
  // Aの希望地座標がBの座標もしくは希望地座標より大きければ戦争勃発
  if (maxOfA >= coordinateB || maxOfA >= minOfB) return true;
  // Bの希望地座標がAの座標もしくは希望地座標より小さければ戦争勃発
  if (minOfB <= coordinateA || minOfB <= maxOfA) return true;
  return false;
}