#include<bits/stdc++.h>

using namespace std;

int main(){


vector<int> A(1000000+7,0),B(1000000+7,0);
multiset<int>usedA,usedB;
set<int>unusedA, unusedB;

int n,a,b;
cin>>n>>a>>b;

usedA.insert(0);
usedB.insert(0);
for(int i=1; i<=1000000; i++){
    unusedA.insert(i);
    unusedB.insert(i);
}

for(int i=1; i<=1000000; i++){
    //najdi grundiho cislo A
    int cisloA = *unusedB.begin();
    int cisloB = *unusedA.begin();
    /*
    cout<<"A"<<endl;
    for(int i=0; i<20; i++)
        cout<<A[i]<<" ";
    cout<<endl;
    cout<<cisloA<<endl;
    cout<<"B"<<endl;
    for(int i=0; i<20; i++)
        cout<<B[i]<<" ";
    cout<<endl;
    cout<<cisloB<<endl;
    */

    A[i] = cisloA;
    B[i] = cisloB;

    usedA.insert(cisloA);
    if(unusedA.find(cisloA)!=unusedA.end())
        unusedA.erase(unusedA.find(cisloA));

    usedB.insert(cisloB);
    if(unusedB.find(cisloB)!=unusedB.end())
        unusedB.erase(unusedB.find(cisloB));

    if(i>=b){
        int cAremove = A[i-b];
        //cout<<"Remove A "<<cAremove<<endl;
        usedA.erase(usedA.find(cAremove));
        if(usedA.find(cAremove)==usedA.end()){
            unusedA.insert(cAremove);
            //cout<<"unused A "<<cAremove<<endl;
        }
    }

    if(i>=a){
        int cBremove = B[i-a];
        //cout<<"Remove B "<<cBremove<<endl;
        usedB.erase(usedB.find(cBremove));
        if(usedB.find(cBremove)==usedB.end()){
            unusedB.insert(cBremove);
            //cout<<"unused B "<<cBremove<<endl;

        }
    }
}

//for(int i=0; i<50; i++)
//    cout<<A[i]<<endl;

int res = 0;
for(int i=0; i<n; i++){
    int x;
    cin>>x;
    res = res^A[x];
}
cout<<(res ? "Petyr" : "Varys")<<endl;



}