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.
n,m,x,y=map(int,input().split())
ans=0
a=list(map(int,input().split()))
b=list(map(int,input().split()))
for i in range(n):
    if a[i]>i and i<=x or y<i:
        ans+=1
for j in range(m):
    if b[j]<i and j<=x or y<j:
        ans+=1
print(ans)
if ans>=1:
    print('No War')
else:
    print('War')
n,m,x,y=map(int,input().split())
ans=0
a=list(map(int,input().split()))
b=list(map(int,input().split()))
for i in range(x+1,y+1):
    if max(a)<i<=min(b) and x<i<=y:
        ans+=1
if ans>=1:
    print('No War')
else:
    print('War')