#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll n,k,sum1,sum2,a[100010],maxnum[100010];
ll cnt,znum[100010];
pair<ll,ll> p[100010];
int main()
{
	ll i,j,l,lasnum,T;
	scanf("%lld",&T);
	while(T--)
	{
		scanf("%lld %lld",&n,&k);
		sum1=sum2=0,cnt=0;
		for(i=1;i<=n;++i)
		{
			scanf("%lld",&a[i]);
			sum1+=a[i];
		}
		for(i=1;i<=k;++i)
			scanf("%lld %lld",&p[i].first,&p[i].second);
		sort(a+1,a+n+1);
		sort(p+1,p+k+1);
		znum[++cnt]=-1;
		for(i=1;i<=k;++i)
		{
			if(!p[i].second)
				znum[++cnt]=p[i].first;
		}
		for(i=1;i<=n;++i)
			maxnum[i]=znum[(lower_bound(znum+1,znum+cnt+1,a[i])-znum)-1];
		lasnum=-1,j=1;
		for(i=1;i<=k&&j<=n;++i)
		{
			if(p[i].first!=lasnum+1)
			{
				while(j<=n)
				{
					if(maxnum[j]>=lasnum+1)
						break;
					sum2+=(lasnum+1),++j;
				}
			}
			else
			{
				for(l=1;l<=p[i].second&&j<=n;++l)
				{
					if(maxnum[j]>=p[i].first)
						break;
					sum2+=p[i].first,++j;
				}
			}
			lasnum=p[i].first;
		}
		while(j<=n)
			sum2+=(lasnum+1),++j;
		if((sum1-sum2)%2==0)
			printf("FuuFuu\n");
		else
			printf("Pico\n");
	}
	return 0;
}