#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 2e5 + 5;
ll Tex, n, m, a[MAXN];
void AC(){
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
    }
    a[n + 1] = (ll)(1e9 + 2);
    sort(a + 1, a + n + 1);
    map<ll, ll> mp;
    vector<pair<ll, ll>> q;
    vector<ll> idx, b;
    b.push_back(0);
    q.push_back({-1, 0});
    for(int i = 1; i <= m; i ++){
        ll x, y;
        cin >> x >> y;
        q.push_back({x, y});
        mp[x] = y;
    }
    sort(q.begin(), q.end());
    for(auto it : q){
        if(it.second == 0){
            idx.push_back(it.first);
        }
    }
    idx.push_back((ll)(1e9 + 1));
    ll dq = 0, l = 1, r = 1;
    for(int i = 0; i < idx.size() - 1; i ++){
        while(a[r] <= idx[i + 1]) r ++;
        ll cnt = r - l;
        while(q[dq].first < idx[i]) dq ++;
        if(q[dq].first <= idx[i + 1]){
            for(int j = q[dq].first + 1; j <= idx[i + 1]; j ++){
                if(!mp.count(j)){
                    while(cnt){
                        b.push_back(j);
                        cnt --;
                    }
                }
                else{
                    ll qwq = mp[j];
                    while(cnt && qwq){
                        b.push_back(j);
                        cnt --;
                        qwq --;
                    }
                }
                dq = j + 1;
                if(!cnt) break;
            }
        }
        l = r;
    }
    ll ans = 0;
    for(int i = 1; i <= n; i ++){
        // cout << b[i] << " ";
        ans += a[i] - b[i];
    }
    if(ans & 1) cout << "Pico\n";
    else cout << "FuuFuu\n";
}
int main(){
    // freopen("J.in", "r", stdin);
    // ios::sync_with_stdio(false);
    // cin.tie(0); cout.tie(0);
    cin >> Tex;
    while(Tex --) AC();
    return 0;
}