#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int x[105];
int y[105];
int main(){
	int n, m;
	cin >> n >> m;
	int X, Y;
	cin >> X >> Y;
	int cnt1 = 0;
	int cnt2 = 0;
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		cin >> x[i];	
	}
	for(int i = 1; i <= m; i++){
		cin >> y[i];
	}
	for(int i = X + 1; i <= Y; i++){
		cnt1 = 0;
		cnt2 = 0;
		for(int j = 1; j <= n; j++){
			if(x[j] < i) cnt1++;
		}
		for(int k = 1; k <= m; k++){
			if(y[k] >= i) cnt2++;	
		}
		if(cnt1 == n && cnt2 == m){
			printf("No War\n");
		}
		cnt++;
	}
	if(cnt == (Y - X)) printf("War\n");
}