#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define sqr(x) ((x) * (x))
#define fi first
#define se second

typedef pair<int, int> ii;

const int OO = 1e9 + 7;
const int MAXN = 1e6 + 6;

int a[MAXN];
int b[MAXN];
int x[MAXN];
map<int, int> mpA, mpB;
int n, A, B, maxX;

int Calc(int a[], int x, int cur)
{
    // TODO: Optimize;
    map<int, bool> mp;
    for (int i = cur - x; i < cur; ++i)
    {
        mp[a[i]] = true;
    }
    for(int i = 0; i <= maxX; ++i)
    {
        if (mp[i] == false)
            return i;
    }
}

void Calc1(int A, int B, int a[], int b[])
{
    for (int i = A + 1; i <= B + 1; ++i)
        b[i] = A + 1;
    for(int i = A + 1; i <= maxX; ++i)
        a[i] = 0;
    for(int i = B + 2; i <= maxX; ++i)
        b[i] = 1;
}

void Sol()
{
    if (A == B)
    {
        for(int i = A + 1; i <= maxX; ++i)
            a[i] = b[i] = i % (A + 1);
    }
    else
    {
        if (A < B)
            Calc1(A, B, a, b);
        else
            Calc1(B, A, b, a);
    }
//    for(int i = min(A, B); i <= maxX; ++i)
//    {
//        if (i - A >= 0)
//            a[i] = Calc(b, A, i);
//        if (i - B >= 0)
//            b[i] = Calc(a, B, i);
//    }
//    for(int i = 0; i <= maxX; ++i)
//        cout << a[i] << ' ';
//    cout << '\n';
//    for(int i = 0; i <= maxX; ++i)
//        cout << b[i] << ' ';
//    cout << '\n';
    int res = a[x[1]];
    for(int i = 2; i <= n; ++i)
        res ^= a[x[i]];
    if (res == 0)
        cout << "Varys\n";
    else
        cout << "Petyr\n";
}

void Inp()
{
    cin >> n >> A >> B;
    maxX = 0;
    for(int i = 1; i <= n; ++i)
    {
        cin >> x[i];
        maxX = max(maxX, x[i]);
    }
    for(int i = 0; i <= A; ++i)
    {
        a[i] = i;
        mpA[i] += 1;
    }
    for(int i = 0; i <= B; ++i)
    {
        b[i] = i;
        mpB[i] += 1;
    }
    Sol();
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    Inp();
    return 0;
}