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

int main(){
  long long n,m,v,p,i;
  cin >> n >> m >> v >> p;
  vector<long long> a(n);
  for(i=0;i<n;i++){
    cin >> a.at(i);
  }
  sort(a.begin(),a.end());
  reverse(a.begin(),a.end());
  
  long long s;
  s=n-1;
  while(a.at(s)+m<a.at(p-1)){
    s--;
  }
  s++;
  
  long long t,V;
  V=n*m;
  t=p-1;
  while(V>=m*v&&t<s){
    t++;
    if(t==n){
      break;
    }
    V=V-(a.at(t-1)-a.at(t))*(t-p+1);
  }
  
  cout << t << endl;
}
#include <bits/stdc++.h>
using namespace std;
 
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
 
#define MAXX 100005
 
#define PI 3.14159265358979323846264338327950
 
#define F first
#define S second
 
#define ll 	 long long int
 
#define mod  1000000007

 
int main()
{
	FAST;
	ll n, m, x, y;
	cin >> n >> m >> x >> y;
	ll a1= -555, a2 = 100; ll f;
	for(ll i = 0; i < n; i ++){
		cin >> f;
		a1 = max(a1, f);
	}
	for(ll i = 0; i < m; i ++){
		cin >> f;
		a2 = min(a2, f);
	}
	if(a1 < a2 && a2 <= y && a2 > x ){
		cout << "No War";
		return 0;
	}
	cout << "War";
	return 0;
}