#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

using namespace std;

#define REP(A,B) for(int (A)=0;(A)<(B);(A)++)
int H[111111];
int main()
{
	int n,A,B;
	scanf("%d%d%d", &n, &A, &B);
	REP(i, n) scanf("%d", H+i);
const char* FP = "Petyr";
	const char* SP = "Varys";
	int maxi = 0;
	sort(H, H+n);
	REP(i, n) maxi = max(maxi, H[i]);
	if(A == B) {
		int X = 0;
		REP(i, n) X ^= H[i]%(A+1);
		if(X == 0) printf("%s\n", SP);
		else printf("%s\n", FP);
		return 0;
	}
	if(A < B) {
		int X = 0;
		REP(i, n) X ^= H[i]%(A+1);
		if(X == 0) {
			printf("%s\n", SP);
		} else {
			int XX = X;
			XX ^= (H[n-1]%(A+1));
			int maxodber = 0;
			for(int odeberu = 1; odeberu <= A && odeberu <= H[n-1]; odeberu++) {
				int XXX = XX^((H[n-1]-odeberu)%(A+1));
				if(XXX == 0)
					maxodber = odeberu;
			}
			if(H[n-1]-maxodber > A || (n > 1 && H[n-2] > A)) {
				printf("%s\n", SP);
			} else {
				printf("%s\n", FP);
			}
		}
	} else {
		int X = 0;
		REP(i, n) X ^= H[i]%(B+1);
		if(X != 0 || maxi > B) {
			printf("%s\n", FP);
		} else printf("%s\n", SP);
	}
	return 0;
}