#include<stdio.

h>
#include<stdlib.h>
#define N 100
int compare (const void * a, const void * b)
{
if ( a < b ) return -1;
if ( a == b ) return 0;
if ( a > b ) return 1;
}
int main()
{
int t,n,m,a[N],i,b,c,d,e;
scanf("%d",&t);
while(t--)
{
scanf("%d %d", &n, &m);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<m;i++)
{
scanf("%d %d",&b,&c);
d=b-1;
e=c-b;
if (b!=c)
qsort(a+d,e,sizeof(int), compare);
}
for (i=0;i<n;i++)
{
printf("%d",a[i]);
}
for (i=1;i<=n;i++)
{
if (a[i-1]!=i)
{
printf("Not possible");
break;
}
}
printf("Possible");}
return(0);
}