#include <bits/stdc++.h>
using namespace std;
const int N=1010;
inline int read()
{
	char ch;
	while((ch=getchar())<'0'||ch>'9');
	int res=ch-'0';
	while((ch=getchar())>='0'&&ch<='9') res=res*10+ch-'0';
	return res;
}
int n,K,a[N][N];
bool dfs(int x,int y,int now)
{
	if(now>K) return 0;
	if(x==n)
	{
		if(now==K)
		{
			for(int i=0;i<n;printf("\n"),i++)
				for(int j=0;j<n;j++)
				printf("%c",a[i][j]?'R':'B');
			return 1;
		}
		return 0;
	}
	a[x][y]=0;
	int tmp=now+(x&&a[x-1][y]!=a[x][y])+(y&&a[x][y-1]!=a[x][y]);
	if(y==n-1?dfs(x+1,0,tmp):dfs(x,y+1,tmp)) return 1;
	a[x][y]=1;
	tmp=now+(x&&a[x-1][y]!=a[x][y])+(y&&a[x][y-1]!=a[x][y]);
	if(y==n-1?dfs(x+1,0,tmp):dfs(x,y+1,tmp)) return 1;
	return 0;
}
struct node{
	int x,y;
	node(int a=0,int b=0){
		x=a,y=b;
	}
};
int val(node u){
	return 4-(u.x==0||u.x==n-1)-(u.y==0||u.y==n-1); 
}
bool operator<(node a,node b){ return val(a)>val(b); }
node d[N*N];
int tot;
bool dfs2(int now,int rst)
{
	if(!rst) return 1;
	if(now>tot) return 0;	
	if(val(d[now])>rst) return 0;
	a[d[now].x][d[now].y]=1;
	if(dfs2(now+1,rst-val(d[now]))) return 1;
	a[d[now].x][d[now].y]=0;
	return dfs2(now+1,rst);
}
int main()
{
	int T=read();
	while(T--)
	{
		n=read(),K=read();
		if(K==1||K==2*(n-1)*n-1) printf("Impossible\n");
		else
		{
			printf("Possible\n");
			if(n<=3) dfs(0,0,0);
			else
			{
				for(int i=0;i<n;i++)
					for(int j=0;j<n;j++)
					{
						a[i][j]=0;
						if(!((i+j)&1)) d[++tot]=node(i,j);	
					}		
				sort(d+1,d+1+tot);
				dfs2(1,K);
				for(int i=0;i<n;printf("\n"),i++)
					for(int j=0;j<n;j++)
					printf("%c",a[i][j]?'R':'B');
			}
		}
	}
	return 0;
}