#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;

int main() {
  int n,m,x,y,flg = 0;
  cin >> n >> m >> x >> y;
  vector<int> X(n), Y(m);

  rep(i,n) cin >> X[i];
  rep(i,m) cin >> Y[i];

  sort(X.begin(), X.end());
  sort(Y.begin(), Y.end());

  for (int i = x+1; i <= y; i++) {
    if (X[n-1] < i && i <= Y[0]) {
      flg = 1;
      break;
    }
  }
  if (flg) cout << "No War" << endl;
  else cout << "War" << endl;
  return 0;
}
#include <iostream>
#include<string>

using namespace std;
class Dice{
public:
	int num[6],t;//t=top
		/*
		dice.num[0] = ???
		dice.num[1] = ???
		dice.num[2] = ???
		dice.num[3] = ???
		dice.num[4] = ???
		dice.num[5] = ???*/

	void North(){
		t = num[0];
		num[0] = num[1];//??????1?????¨???
		num[1] = num[5];//??????2?????¨???
		num[5] = num[4];//??????6?????¨???
		num[4] = t;//??????5?????¨???
		}

	void East(){
		t = num[0];
		num[0] = num[3];//??????1?????¨???
		num[3] = num[5];//??????4?????¨???
		num[5] = num[2];//??????6?????¨???
		num[2] = t;//??????3?????¨???
		}

	void West(){
		t = num[0];
		num[0] = num[2];//??????1?????¨???
		num[2] = num[5];//??????5?????¨???
		num[5] = num[3];//??????6?????¨???
		num[3] = t;//??????2?????¨???
		}
		
	void South(){
		t = num[0];
		num[0] = num[4];//??????1?????¨???
		num[4] = num[5];//??????3?????¨???
		num[5] = num[1];//??????6?????¨???
		num[1] = t;//??????3?????¨???
		}
	
	void Rotation(){//?????¢??????????????§?????¢???????????¨???
		t = num[1];
		num[1] = num[2];//?????¢???2?????¨???
		num[2] = num[4];//?????¢???3?????¨???
		num[4] = num[3];//?????¢???5?????¨???
		num[3] = t;//?????¢???4?????¨???
		}
};

int main()
{
	Dice d[100];
	
	int n;
	cin >> n;
	
	for(int i=0; i<n; i++){
		cin >> d[i].num[0] >> d[i].num[1] >> d[i].num[2] >> d[i].num[3] >> d[i].num[4] >> d[i].num[5];
	}
	
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
		//?????¢??????????????????
		if(( d[i].num[2] == d[j].num[0] || d[i].num[3] == d[j].num[0]) && d[i].num[0] != d[j].num[5]){
			d[i].East();
		}
		//?????¢??????????¨???????
		for(int k = 0; k<4; k++){
			if(d[i].num[0] == d[j].num[0])break;
			d[i].North();
		}
		////?????¢?????????????????????
		for(int k = 0; k<4; k++){
			if(d[i].num[1] == d[j].num[1])break;
			d[i].Rotation();
		}
		for(int k = 0; k<4; k++){
			if(d[i].num[2] == d[j].num[2])break;
			d[i].Rotation();
		}
		for(int k = 0; k<4; k++){
			if(d[i].num[3] == d[j].num[3])break;
			d[i].Rotation();
		}
		for(int k = 0; k<4; k++){
			if(d[i].num[4] == d[j].num[4])break;
			d[i].Rotation();
		}
		for(int k = 0; k<4; k++){
			if(d[i].num[5] == d[j].num[3])break;
			d[i].Rotation();
		}
			if( d[i].num[0] == d[j].num[0] &&
				d[i].num[1] == d[j].num[1] &&
				d[i].num[2] == d[j].num[2] &&
				d[i].num[3] == d[j].num[3] &&
				d[i].num[4] == d[j].num[4] &&
				d[i].num[5] == d[j].num[5] ){
					cout << "No" << endl;
					return 0;
			}
		}
		
	}
	cout << "Yes" << endl;
	return 0;
}