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: #!/usr/bin/env python3
  # -*- coding: utf-8 -*-
  """
  Created on Mon Feb 11 05:38:56 2019
  
  @author: shinjisu
  """
  
  
  # ABC 200点問題
  import math
  
  
  def getInt():
      return int(input())
  
  
  def getIntList():
      return [int(x) for x in input().split()]
  
  
  def zeros(n):
      return [0] * n
  
  
  def dmp(x):
      global debug
      if debug:
          print(x)
  
  
  debug = True
  
  
  def getIntLines(n):
      return [int(input()) for i in range(n)]
  
  
  def getIntMat(n):
      mat = []
      for i in range(n):
          mat.append(getIntList())
      return mat
  
  
  def zeros2(n, m):
      return [zeros(m)] * n
  
  
  def prob096():  # Maximum Sum
      X = getIntList()
      K = getInt()
      dmp((X, K))
      total = sum(X) - max(X) + max(X) * 2**K
      return total
  
  
  def prob097():  # Exponential
      X = getInt()
      dmp(X)
      if X == 1:
          return 1
      for n in range(X, 0, -1):
          dmp(n)
          for b in range(2, int(math.sqrt(X)) + 1):
              a = n
              exp = True
              while a > 1:
                  if a % b != 0:
                      exp = False
                      break
                  a //= b
              if exp:
                  break
          if exp:
              break
      return n
  
  
  def prob098():  # Cut and Count
      N = getInt()
      S = input()
      dmp((N, S))
      maxChCount = 0
      for i in range(1, N):
          before = S[:i]
          after = S[i:]
          dmp((before, after))
          chCount = 0
          for j in range(26):
              ch = chr(ord("a") + j)
              if ch in before and ch in after:
                  chCount += 1
          maxChCount = max(maxChCount, chCount)
      return maxChCount
  
  
  def prob099():  # Stone Momument
      a, b = getIntList()
      height = 0
      for i in range(b - a + 1):
          height += i
      height -= b
      return height
  
  
  def prob103():  # String Rotation
      S = input()
      T = input()
      for i in range(len(S)):
          S = S[1:] + S[0]
          dmp(S)
          if S == T:
              return "Yes"
      else:
          return "No"
  
  
  def prob110():  # 1 Dimensional World's Tale
      N, M, X, Y = getIntList()
      cX = getIntList()
      cY = getIntList()
      dmp((N, M, X, Y))
      dmp(cX)
      dmp(cY)
      NW = "No War"
      WA = "War"
      if Y <= X:
          return WA
      cX.sort()
      cY.sort()
      dmp(cX)
      dmp(cY)
      if cX[-1] < cY[0] and X < cY[0] and cX[-1] < Y:
          return NW
      else:
          return WA
  
  
  def prob100():  #
      return 0
  
  
  debug = False  # True False
  print(prob110())
  
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"}]