#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (100005)
int N,a,b,X,A[MX],I=-1;
int main(void){
    scanf("%d%d%d",&N,&a,&b),ga(N,A);
    F(N)if(a==b||A[i]<=min(a,b))X^=(A[i]<=min(a,b)?A[i]:A[i]%(min(a,b)+1));
        else if(!~I)I=i;
        else return puts(a<b?"Varys":"Petyr"),0;
    if(~I){
        if(a>b)return puts("Petyr"),0;
        FT(1,a+1)if(A[I]-k<=a&&!(X^(A[I]-k)))return puts("Petyr"),0;
        return puts("Varys"),0;
    }
    puts(X?"Petyr":"Varys");
    return 0;
}