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.
#coding:utf-8

N, M, X, Y = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))

'''
result1 = (X < Z) and (Z <= Y)

num_violate2 = len([i for i in x if i >= Z])
if num_violate2 > 0:
    result2 = False
else:
    result2 = True

num_violate3 = len([i for i in x if i < Z])
if num_violate3 > 0:
    result3 = False
else:
    result3 = True

if result1 and result2 and result3:
    print('No War')
else:
    print('War')
'''

result1 = X < Y
x = sorted(x)
y = sorted(y)
result2 = x[-1] + 1 < y[0]

if result1 and result2:
    print('No War')
else:
    print('War')

#coding:utf-8

N, M, X, Y = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))

'''
result1 = (X < Z) and (Z <= Y)

num_violate2 = len([i for i in x if i >= Z])
if num_violate2 > 0:
    result2 = False
else:
    result2 = True

num_violate3 = len([i for i in x if i < Z])
if num_violate3 > 0:
    result3 = False
else:
    result3 = True

if result1 and result2 and result3:
    print('No War')
else:
    print('War')
'''

x.append(X)
y.append(Y)

x = sorted(x)
y = sorted(y)

if x[-1] < y[0]:
    print('No War')
else:
    print('War')