#include<bits/stdc++.h>

using namespace std;

#define pll pair<ll, ll>
#define ll long long
#define x first
#define y second
const int mod = 1e9 + 7;
const int N = 1e5 + 50;

vector<ll> e[N];
vector<pll> q;
pll pa[N];
ll n, k, a[N], res[N], sum[N], sum0[N], siz[N];
map<ll, ll> mp, mp1;

void check(ll x)
{
    if (x % 2 == 0) cout << "FuuFuu" << '\n';
    else cout << "Pico" << '\n'; 
    return ;
}

void solve()
{
    ll ok = 0, cnt;
    cin >> n >> k;
    mp.clear();
    mp1.clear();
    for (int i = 0; i <= k + 10; i++) 
    {
        e[i].clear();
        res[i] = 0;
        sum[i] = sum0[i] = 0;
        siz[i] = 0;
    }
    q.clear();

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        mp[a[i]] ++;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) res[i] = res[i - 1] + a[i];
    for (int i = 1; i <= k; i++) 
    {
        cin >> pa[i].x >> pa[i].y;
        if (mp[pa[i].x] > pa[i].y) ok = 1;
        mp1[pa[i].x] = pa[i].y;
    }
    if (k == 0)
    {
        check(res[n]);
        return ;
    }
    if (ok == 1)
    {
        check(0);
        return ;
    }
    sort(pa + 1, pa + k + 1);
    vector<ll> v;
    ll l = 0, r = 0;
    for (int i = 1; i <= k; i++)
    {
        if (pa[i].y == 0) v.push_back(pa[i].x);
    }
    ll p = 0;
    cnt = 0;
    q.push_back({0, 0});

    if (v.size() == 0)
    {
        cnt ++;
        q.push_back({0, 1e18});
    }
    else
    {
        if (v[0] > 0)
        {
            cnt ++;
            q.push_back({0, v[0] - 1});
        }
        while (p < v.size() - 1)
        {
            while (p < v.size() - 1 && v[p + 1] == v[p] + 1) p ++;
            cnt ++;
            if (p == v.size() - 1) q.push_back({v[p] + 1, 1e18});
            else q.push_back({v[p] + 1, v[p + 1] - 1});
            p ++;
        }
        if (v.size() == 1)
        {
            cnt ++;
            q.push_back({v[0] + 1, 1e18});
        }
    }
    p = 1;
    for (int i = 1; i <= cnt; i++)
    {
        while (p <= n && a[p] >= q[i].x && a[p] <= q[i].y)
        {
            sum[i] += a[p];
            p ++;
            siz[i] ++;
        }
    }
    ll op = 0, va;
    for (int i = 1; i <= cnt; i++)
    {
        op = 0;
        for (int j = q[i].x; j <= q[i].y; j++)
        {
            if (mp1[j] == 0) va = 1e6;
            else va = mp1[j];
            if (va + op >= siz[i])
            {
                sum0[i] += j * (siz[i] - op);
                break;
            }
            else
            {
                sum0[i] += j * va;
                op += va;
            }
        }
    }
    ll ans = 0;
    for (int i = 1; i <= cnt; i++)
    {
        if (sum[i] > 0) ans += sum[i] - sum0[i];
    }
    //cout << ans << '\n';
    check(ans);
    //for (int i = 1; i <= cnt; i++) cout << q[i].x << ' ' << q[i].y << '\n';
}


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll T = 1;
    cin >> T;
    while (T --)
    {
        solve();
    }
    
    return 0;
}