#include <bits/stdc++.h>
using namespace std;

int main(void) {
  int n, m; cin >> n >> m;
  vector<int> xt(n+1); cin >> xt[0];
  vector<int> yt(m+1); cin >> yt[0];
  for (int i=1; i<n+1; i++) cin >> xt.at(i);
  for (int i=1; i<m+1; i++) cin >> yt.at(i);
  sort(xt.begin(), xt.end());
  sort(yt.begin(), yt.end());
  
  if (xt[n] >= yt[0]) {
    cout << "War" << endl;
  } else {
    cout << "No War" << endl;
  }
  
  return 0;
}
#include<iostream>
#include<string>
#include<stdio.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<vector>

using namespace std;

int main(){
    int N,M,X,Y;cin >> N >> M >> X >> Y;
    int x[100]={};
    int y[100]={};
    int flag = 1;
    for(int i = 0;i < N;i++)cin >> x[i];
    for(int i = 0;i < M;i++)cin >> y[i];
    for(int i = X+1;i <= Y;i++){
        flag = 1;
        for(int j=0;j < N;j++){
            if(x[j] >= i){
                flag = 0;
                continue;
            }
        }
        if(flag==0)continue;
        for(int j = 0;j < M;j++){
            if(y[j] < i){
                flag = 0;
                continue;
            }
        }
        if(flag == 1)break;
    }
    if(flag == 1)cout << "No War" << endl;
    else cout << "War" << endl;
}