SPOJ OFFSIDE

// http://www.spoj.com/problems/OFFSIDE/
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
	int a, d;
	cin >> a >> d;
	vector<int> A;
	vector<int> D;
	while (a != 0 && d != 0) {
		int t;
		for (int i = 0; i < a; i++) {
			cin >> t;
			A.push_back(t);
		}
		for (int i = 0; i < d; i++) {
			cin >> t;
			D.push_back(t);
		}
		sort(A.begin(), A.end());
		sort(D.begin(), D.end());

		if (A[0] < D[1]) {
			cout << "Y" << endl;
		}
		else {
			cout << "N" << endl;
		}
		A.clear();
		D.clear();
		cin >> a >> d;
	}

	return 0;
}