#include<bits/stdc++.h>
using namespace std;

#define MAXN 210005
#define int long long

struct aa {
	int x,y;
}c[MAXN];
int a[MAXN];
int n,m;

bool cmp(aa a,aa b) {
	return a.x < b.x;
}

signed main() {
	int T;
	cin >> T;
	while(T --) {
		cin >> n >> m;
		for(int i = 0; i <= max(n,m)+5; i ++) {
			a[i] = 0; c[i].x = 0; c[i].y = 0;
		}
		for(int i = 1; i <= n; i ++)
			cin >> a[i];
		for(int i = 1; i <= m; i ++)
			cin >> c[i].x >> c[i].y;
		sort(c+1,c+m+1,cmp);
		sort(a+1,a+n+1);
		int x = 1;
		int w = 1,st = 0,an = 0;
		c[m+1].x = 1e18;
		for(int i = 1; i <= m+1; i ++) {
			if(c[i].y == 0 || i == m+1) {
				for(int j = w; j < i; j ++) 
				if(c[j].x == st) {
					st ++;
					for(int k = 1; k <= c[j].y; k ++) 
					if(x <= n && a[x] < c[i].x) {
						an += a[x]-c[j].x;
						x ++;
					}
				} else break;
				while(x <= n && a[x] < c[i].x) {
					an += a[x]-st;
					x ++;
				}
				w = i+1;
				st = c[i].x+1;
			//	cout<<i<<" "<<w<<" "<<x<<" "<<an<<" "<<st<<"\n";
			}
		}
		//cout<<an<<"\n";
		if(an%2 == 0) cout<<"FuuFuu\n";
		else cout<<"Pico\n"; 
	}
	return 0;
} 
/*
5
2 0
1 2

2 1
1 2
0 1
3 2

3 3 4
0 2
1 1
3 2
2 3 3
1 2
0 1
5 4
6 7 8 12 17
1 1
2 1
9 0
10 1

*/