#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];

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

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);
	}
	
	int is = 0;
	for(int i = 1; i <= n; ++i)
		is += in[i] > min(a, b);
	
	int mask = solve();
	if(mask && a > b){
		puts("Petyr");
		exit(0);
	}
	
	if(!mask && a < b){
		puts("Varys");
		exit(0);
	}
	
	if(is > 1 || (is == 1 && a > b)) {
		if(a > b)
			puts("Petyr");
		else
			puts("Varys");
		exit(0);
	}
	
	if(is == 0)
	{
		puts(mask ? "Petyr" : "Varys");
		return 0;
	}
	
	for(int i = 1; i <= n; i++)
	{
		if(in[i] > min(a, b))
		{
			int k = in[i];
			int mn = min(a, b);
			bool any = false;
			for(int j = k - mn; j < k && j <= mn; j++)
				if((mask ^ j ^ k) == 0) any = true;
			puts(any == (a < b) ? "Petyr" : "Varys");
		}
	}
}