#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>

using namespace std;

typedef long long ll;

#define maxn 105

int const inf = 0x3f3f3f3f;

int x[maxn],y[maxn];
int max_x = 0,min_y = inf;

int n,m;
int X,Y;

bool check(int mid){

	if((mid > X && mid <= Y) && max_x < mid && min_y >= mid) return true;

	else 
		
		return false;
}

int main(){

	while(cin >> n >> m >> X >> Y)
	{

		max_x = 0;
		min_y = inf;

		for(int i = 1;i <= n;i++)
		{
			scanf("%d",&x[i]);
			max_x = max(max_x,x[i]);
		}

		for(int i = 1;i <= m;i++)
		{
			scanf("%d",&y[i]);
			min_y = min(min_y,y[i]);
		}

		if(min_y <= max_x)
		{
			puts("War");
			continue;
		}

		int l,r,mid;
		bool flag = false;

		l = X,r = Y;

		while(l <= r)
		{
			mid = (l + r) / 2;

			if(check(mid))
			{
				flag = true;
				break;
			}

			else
			{
				if(max_x >= mid)
				{
					l = mid + 1;
				}

				if(min_y < mid)
				{
					r = mid - 1;
				}

			}

			if(l == r) break;

		}

		if(flag) puts("No War");
		else puts("War");

	}

	return 0;
}