#include <bits/stdc++.h>

#define FOR(n, a, b) for(int n = (a); n < (b); ++n)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define st first
#define nd second

using namespace std;


int main()
{
    int n, in[2], Xor = 0, Last;
    long long any = 0;

    scanf ("%d%d%d", &n, in+0, in+1);
    int c = min(in[0], in[1]) + 1;

    while (n--)
    {
        int x;
        scanf ("%d", &x);
        any += x / c;
        if (x / c != 0)
            Last = x % c;
        Xor ^= x % c;
    }

    int winner = Xor == 0 ? 1 : 0, cheater = winner ^ 1;

    if (c < in[cheater] + 1 and any != 0)
    {
        if (cheater == 0)
            winner = cheater;

        else
        {
            if (any > 1)    winner = cheater;
            else
            {
                bool maycheat = true;

                FOR(m, Last+1, c)
                    if ((Xor ^ Last ^ m) == 0)
                        maycheat = false;
                if (maycheat)
                    winner = cheater;
            }
        }
    }

    printf("%s\n", winner == 1 ? "Varys" : "Petyr");
    return 0;
}