output_description: If war will break out, print `War`; otherwise, print `No War`.
  
  * * *
input_description: 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
attempt: # -*- coding: utf-8 -*-
  
  #############
  # Libraries #
  #############
  
  import sys
  
  input = sys.stdin.readline
  
  import math
  import bisect
  from collections import deque
  from fractions import gcd
  from functools import lru_cache
  
  
  #############
  # Constants #
  #############
  
  MOD = 10**9 + 7
  INF = float("inf")
  
  #############
  # Functions #
  #############
  
  
  ######INPUT######
  def inputI():
      return int(input().strip())
  
  
  def inputS():
      return input().strip()
  
  
  def inputIL():
      return list(map(int, input().split()))
  
  
  def inputSL():
      return list(map(str, input().split()))
  
  
  def inputILs(n):
      return list(int(input()) for _ in range(n))
  
  
  def inputSLs(n):
      return list(input().strip() for _ in range(n))
  
  
  def inputILL(n):
      return [list(map(int, input().split())) for _ in range(n)]
  
  
  def inputSLL(n):
      return [list(map(str, input().split())) for _ in range(n)]
  
  
  ######OUTPUT######
  def Yes():
      print("Yes")
      return
  
  
  def No():
      print("No")
      return
  
  
  #####Inverse#####
  def inv(n):
      return pow(n, MOD - 2, MOD)
  
  
  ######Combination######
  kaijo_memo = []
  
  
  def kaijo(n):
      if len(kaijo_memo) > n:
          return kaijo_memo[n]
      if len(kaijo_memo) == 0:
          kaijo_memo.append(1)
      while len(kaijo_memo) <= n:
          kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
      return kaijo_memo[n]
  
  
  gyaku_kaijo_memo = []
  
  
  def gyaku_kaijo(n):
      if len(gyaku_kaijo_memo) > n:
          return gyaku_kaijo_memo[n]
      if len(gyaku_kaijo_memo) == 0:
          gyaku_kaijo_memo.append(1)
      while len(gyaku_kaijo_memo) <= n:
          gyaku_kaijo_memo.append(
              gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo), MOD - 2, MOD) % MOD
          )
      return gyaku_kaijo_memo[n]
  
  
  def nCr(n, r):
      if n == r:
          return 1
      if n < r or r < 0:
          return 0
      ret = 1
      ret = ret * kaijo(n) % MOD
      ret = ret * gyaku_kaijo(r) % MOD
      ret = ret * gyaku_kaijo(n - r) % MOD
      return ret
  
  
  ######Factorization######
  def factorization(n):
      arr = []
      temp = n
      for i in range(2, int(-(-(n**0.5) // 1)) + 1):
          if temp % i == 0:
              cnt = 0
              while temp % i == 0:
                  cnt += 1
                  temp //= i
              arr.append([i, cnt])
      if temp != 1:
          arr.append([temp, 1])
  
      if arr == []:
          arr.append([n, 1])
      return arr
  
  
  #####LCM#####
  def lcm(a, b):
      return a * b // gcd(a, b)
  
  
  #####BitCount#####
  def count_bit(n):
      count = 0
      while n:
          n &= n - 1
          count += 1
      return count
  
  
  #############
  # Main Code #
  #############
  
  N, M, X, Y = inputIL()
  x = inputIL()
  y = inputIL()
  
  if max(x) >= min(y):
      print("War")
  else:
      print("No War")
  
problem_description: 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.
samples: [{"input": "3 2 10 20\n    8 15 13\n    16 22", "output": "No War\n    \n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they\nwill come to an agreement.\n\n  * X = 10 < 16 \\leq 20 = Y\n  * 8, 15, 13 < 16\n  * 16, 22 \\geq 16\n\n* * *"}, {"input": "4 2 -48 -1\n    -20 -35 -91 -23\n    -22 66", "output": "War\n    \n\n* * *"}, {"input": "5 3 6 8\n    -10 3 1 5 -100\n    100 6 14", "output": "War"}]