#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> vec(3);
int m,n,x,y;
int main() {
	cin>>m>>n>>x>>y;
	int X[m];
	int Y[n];
	for(int i=0;i<m;i++)cin>>X[i];
	for(int i=0;i<n;i++)cin>>Y[i];
	sort(X,X+m);
	sort(Y,Y+n);
	if(max(X[m-1],x)<min(Y[0],y))cout<<"No War"<<endl;
	else cout<<"War"<<endl;
	return 0;
}