#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#define INF 1000000007
#define pi 3.141592653589793
using namespace std;
int saidaikouyakusuu(int a,int b){
    if(b==0) return a;
    return saidaikouyakusuu(b,a%b);
}
int saisyoukoubaisuu(int a,int b){
    return a*b/saidaikouyakusuu(a,b);
}
int n,m,cnt=0,aa[220000],ans=0,x,y,ab[220000];
pair<int,int> pp[220000];
string s,ss[220000];
char c;
queue<int> que;
signed main(){
    cin>>n>>m>>x>>y;
    rep(i,n){
        cin>>aa[i];
        x=max(x,aa[i]);
    }
    rep(i,m){
        cin>>ab[i];
        y=min(y,ab[i]);
    }
    if(y<=x){
        cout<<"War"<<endl;
    }else{
        cout<<"No War"<<endl;
    }
}
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
  ll a;
  cin>>a;
  ll b;
  cin>>b;
  ll c=-100;
  ll d=100;
  ll e,f;
  cin>>e>>f;
  for(ll i=0; i<a;i++){
    ll g;
    cin>>g;
    c=max(g,c);
  }
  for(ll i=0;i<b;i++){
    ll h;
    cin>>h;
    d=min(h,d);
  }
  if(c+1>d){
    cout<<"War"<<endl;
    return 0;
  }
  
    for(ll i=e+1;i<=f;i++){
      if(c+1<=i&&i<=d){
        cout<<"No War"<<endl;
        return 0;
      }
    }
    cout<<"War"<<endl;
  return 0;
}
