#include<bits/stdc++.h>
using namespace std;

#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define LD long double
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define FORD(i, b, e) for (int i = (b); i >= (int)(e); i--)
#define ll LL
#define mp MP
#define pb PB
#define st f
#define nd s
#define eb emplace_back
const int inf = 1e9 + 7;
const LL INF = 1e18L + 7;

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type
{int o = 0; for (auto c : y) {if (o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if (p > y) p = y;}
sim, class s> void maxi(n &p, s y) {if (p < y) p = y;}

#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif

#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "
const int M = 1024 * 1024;

int T[M], AA[M], mex[M];
int A, B, n;
string a, b;

void row()
{
	set<int> secik;
	FOR(i, 0, A)
	{
		mex[i] = i;
		AA[i] = 1;
	}
	AA[0]--;
	secik.insert(0);
	FOR(i, A + 1, M - 1)
	{
		mex[i] = *secik.begin();
		AA[mex[i]]++;
		if (AA[mex[i]] == 1)
		{
			secik.erase(mex[i]);
		}
		AA[mex[i - A]]--;
		if (AA[mex[i - A]] == 0)
		{
			secik.insert(mex[i - A]);
		}
	}
	int res = 0;
	FOR(i, 1, n)
	{
		res ^= mex[T[i]];
	}
	if (res == 0)
	{
		printf("Varys\n");
	}
	else
	{
		printf("Petyr\n");
	}
}

int main()
{
	a = "Petyr";
	b = "Varys";
	scanf("%d%d%d", &n, &A, &B);
	FOR(i, 1, n)
	{
		scanf("%d", T + i);
	}
	if (A == B)
	{
		row();
		return 0;
	}
	bool pier = 1;
	if (A < B)
	{
		pier = 0;
		swap(A, B);
		swap(a, b);
	}
	int ma = 0, wi = 0, x = 0;
	FOR(i, 1, n)
	{
		if (T[i] <= B)
		{
			x ^= T[i];
		}
		else
		{
			maxi(ma, T[i]);
			wi++;
		}
	}
	if (wi > 1)
	{
		printf("%s\n", a.c_str());
		return 0;
	}
	if (wi == 0)
	{
		if (x == 0)
		{
			printf("Varys\n");
		}
		else
		{
			printf("Petyr\n");
		}
		return 0;
	}
	//printf("%d %d %d %d\n", ma, wi, x, pier);
	if (x == 0 || pier)
	{
		printf("%s\n", a.c_str());
	}
	else if (ma <= min(x, B) + B)
	{
		printf("%s\n", b.c_str());
	}
	else
	{
		printf("%s\n", a.c_str());
	}
}