#include<bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define all(b) b.begin(),b.end()
using namespace std;
int t,n,k;
int a[100010];
map<int,int> ss;
struct node
{
	int x,y;
	friend bool operator < (const node &a,const node &b)
	{
		return a.x<b.x;
	}
}q[100010];
int main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>t;
	while(t--)
	{
	  cin>>n>>k;
	  ll s=0;
	  for(int i=1;i<=n;i++) cin>>a[i],s+=a[i];
	  sort(a+1,a+n+1);
	  bool f=0;
	  for(int i=1;i<=k;i++) 
	  {
	  		cin>>q[i].x>>q[i].y;
	  		if(ss[q[i].x]>q[i].y) f=1;
	  }
	  assert(!f);
	  k++;
	  q[k].x=-1;
	  q[k].y=0;
	  sort(q+1,q+k+1);
	  int c=0,op=n;
	  for(int i=k;i>=1;i--)
	  {
	  		while(op>0&&a[op]>=q[i].x) op--,c++;
	  		if(q[i].y==0)
	  		{
	  			int d=i+1,p=q[i].x;
	  			while(c)
	  			{
	  				p++;
	  				int cc;
	  				if(d<=k&&q[d].x==p) cc=q[d].y,d++;
	  				else cc=1e9;
	  				if(cc>=c) s-=1ll*c*p,c=0;
	  				else c-=cc,s-=1ll*cc*p;
				}
			}
	  }
	  cout<<(s%2?"Pico\n":"FuuFuu\n");
  	}
	return 0;
}