#include <bits/stdc++.h>

using namespace std;

typedef long long int LL;

#define st first
#define nd second
#define PII pair <int, int>

const int N = 1e5 + 7;

int n;
int a, b;
int in[N];

bool solve(){
	int ret = 0;
	for(int i = 1; i <= n; ++i)
		ret ^= (in[i]%(min(a, b) + 1));
	return ret > 0;
}

int main(){
	scanf("%d", &n);
	scanf("%d %d", &a, &b);
	for(int i = 1; i <= n; ++i)
		scanf("%d", &in[i]);
	
	if(a == b){
		puts(solve() ? "Petyr" : "Varys");
		exit(0);
	}
	
	bool is = false;
	for(int i = 1; i <= n; ++i)
		is |= in[i] > min(a, b);
	
	bool mask = solve();
	if(mask && a > b){
		puts("Petyr");
		exit(0);
	}
	
	if(!mask && a < b){
		puts("Varys");
		exit(0);
	}
	
	if(is){
		if(a > b)
			puts("Petyr");
		else
			puts("Varys");
		exit(0);
	}
	
	puts(mask ? "Petyr" : "Varys");
	return 0;
}