#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define get getchar()
#define re
#define in inline
const int _ = 1e5 + 23;
in int read() {
    int t = 0;
    char ch = get;
    while (ch < '0' || ch > '9') ch = get;
    while (ch <= '9' && ch >= '0') t = t * 10 + ch - '0', ch = get;
    return t;
}
struct node {
    int x, y;
} l[_];
int a[_], n, k, ans, num = 0;
map<ll, int> mp;
int cmp(node a, node b) { return a.x < b.x; }
in int solve(int L, int R, int now) {
    if (now > n) return now;
    //    cout << l[L].x << endl;
 //   if (mp[l[L].x] > 0) num += mp[l[L].x];
  //  if (num > 1) return -1;
    int sum1 = 0, sum2 = 0, sss = 0, fff = -1;
    //   cout << num << endl;
    int lst = now;
    while (now <= n && a[now] < l[R + 1].x) sum2 += a[now], now++;
    if (now <= n && a[now] <= l[R + 1].x) sum2 += a[now], now++;
    for (int i = L + 1; i <= R; ++i) {
   //     if (mp[l[i].x] > l[i].y) num += mp[l[i].x] - l[i].y;
   //     if (num > 1) return -1;
        if (fff == -1 && l[i].x - l[L].x != i - L) fff = l[i - 1].x + 1;
        if (fff == -1) {
            int qwe = min(now - lst - sss, l[i].y);
            sum1 += l[i].x * qwe, sss += qwe;
        }
    }
    if (fff == -1) fff = l[R].x + 1;

    //    cout << L << ' ' << R << ": " << num << ' ' << sum2 << ' ' << sum1 << ' ' << sss << ' ' << now - lst << ' ' << fff << endl;
    ans += max(0LL, sum2 - sum1 - max(0LL, now - lst - sss) * fff);
    return now;
}
signed main() {
    int T = read();
    while (T--) {
        cin >> n >> k;
        mp.clear();
        ans = 0;
        num = 0;
        for (int i = 1; i <= n; ++i) {
            a[i] = read();
            if (!mp[a[i]])
                mp[a[i]] = 1;
            else
                mp[a[i]]++;
        }
        sort(a + 1, a + n + 1);
        for (int i = 1; i <= k; ++i) l[i].x = read(), l[i].y = read();
        l[++k].x = -1, l[k].y = 0;
        l[++k].x = 1000000001, l[k].y = 0;
        sort(l + 1, l + k + 1, cmp);
        int lst = 1, now = 1;
        for (int i = 2; i <= k; ++i) {
            if (l[i].y == 0) {
                now = solve(lst, i - 1, now);
                if (now == -1) break;
                lst = i;
            }
        }
        //        cout << "! " << ans << ' ' << num << endl;
        if (now == -1 || num > 1) {
            puts("FuuFuu");
            continue;
        }
        if (ans & 1)
            puts("Pico");
        else
            puts("FuuFuu");
    }
}