#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define N 100007

int a[N];

#define fr first
#define sc second
#define mp make_pair
#define pb push_back

vector<pii> lim, tmplim;

vector<int> tmp;

inline void work() {
	lim.clear();
	int n = rd(), k = rd();
	for (int i = 1; i <= n; ++i) a[i] = rd();
	sort(a + 1, a + 1 + n);
	for (int i = 1; i <= k; ++i) {
		int x = rd(), y = rd();
		lim.push_back(mp(x, y));
	} 
	lim.push_back(mp(1000000001, 0));
	sort(lim.begin(), lim.end());
	int ptr = 1, den = -1, mx = 0;
	ll ans = 0;
	auto calc = [&](){
		int id = 0;
		ll sum = 0, cnt = tmp.size();
		for (auto x : tmp) sum += x;
		ll fin = 0;
		for (int i = den + 1, limid = tmplim.size(); i <= mx; ++i, ++id) {
			if (id >= limid) {fin = i; break;}
			if (tmplim[id].fr > i) {fin = i; break;}
			ll t = min(cnt, (ll)tmplim[id].sc);
			cnt -= t; sum -= t * i;	
			if (!cnt) break;
		}
		sum -= cnt * fin;
		ans += sum;
		tmp.clear();
		tmplim.clear();
	};
	for (auto [x, y] : lim) {
		while (ptr <= n && a[ptr] < x) tmp.pb(a[ptr++]);
		if (y == 0) {mx = x - 1; calc(); den = x;}
		else tmplim.push_back(mp(x, y));
	}
	tmplim.clear();
	tmp.clear();
	puts((ans & 1) ? "Pico" : "FuuFuu");
}

int main() {
	for (int t = rd(); t; --t) work();
	return 0;
}