// created:  2025-03-11 08:07:31
#include<cstdio>
#include<cctype>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>constexpr bool is_integral_128=(bool)is_integral<T>::value I128;
template<typename T>struct read_dec1{enable_if_t<is_integral_128<T>,T> &x;};
constexpr struct read_dec1_conv{template<typename T>read_dec1<T> operator+(T &x)const{return read_dec1<T>{x};}}D;
template<typename T>enable_if_t<is_integral_128<T>,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>void readmain(read_dec1<T> &y){readmain(y.x);--y.x;}
template<typename T>T& read(T &&x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &&x,Tr&&... r){readmain(x);read(r...);}
constexpr int N=1e6+5;
constexpr int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
template<typename T>struct d2array
{
	T a[N];int m;
	T *operator[](int x){return a+x*m;}
};
d2array<char> a;
void maximal(int n,int m,int x,int y)
{
	F(i,0,n)F(j,0,m)a[i][j]='.';
	if(n==1)
	{
		F(i,0,y)a[0][i]='#';
		return;
	}
	if(n==2)
	{
		F(i,0,m)a[0][i]='#';
		a[1][0]='#';
		if(y<m-1)a[1][m-1]='#';
		return;
	}
	F(i,0,n)a[i][0]=a[i][m-1]='#';
	F(i,0,m)a[0][i]=a[n-1][i]='#';
	for(int i=n-3;i>=2;i-=2)F(j,1,m-2)a[i][j]='#';
	if(~n&1)for(int j=2;j<m-2;j+=2)a[1][j]='#';
	if(x==n-1&&y==m-1)
	{
		a[n-1][m-2]='.';
		a[n-1][m-1]='.';
		return;
	}
	if(x==n-1||y==m-1)return a[x][y]='.',void();
	if(a[x][y]=='#')a[x][y]='.',a[x][m-2]='#';
}
int q[N],qf,qr;
d2array<int> d;
void shrink(int n,int m,int c)
{
	auto run=[&]()->void
	{
		while(qf<qr&&c)
		{
			int u=q[qf++];--c;
			a[0][u]='.';
			F(i,0,4)if(d[0][u]>>i&1)
			{
				int v=u+dx[i]*m+dy[i];
				if(__builtin_popcount(d[0][v]^=1<<(i^1))==1)q[qr++]=v;
			}
		}
	};
	qf=qr=0;
	F(i,0,n)F(j,0,m)d[i][j]=0;
	F(i,0,n)F(j,0,m-1)if(a[i][j]=='#'&&a[i][j+1]=='#')d[i][j]|=1,d[i][j+1]|=2;
	F(i,0,n-1)F(j,0,m)if(a[i][j]=='#'&&a[i+1][j]=='#')d[i][j]|=4,d[i+1][j]|=8;
	d[0][0]|=16;
	F(i,0,n)F(j,0,m)if(a[i][j]=='#'&&__builtin_popcount(d[i][j])<=1)q[qr++]=i*m+j;
	run();
	d[0][0]^=16;
	run();
	q[qr++]=1;
	run();
}
void flipped(int n,int m,int x,int y,int w)
{
	maximal(n,m,x,y);
	int wt=0;
	F(i,0,n)F(j,0,m)wt+=a[i][j]=='.';
	if(w<wt)
	{
		F(i,0,n)F(j,0,m)a[i][j]=0;
		return;
	}
	shrink(n,m,w-wt);
}
void transposed(int n,int m,int x,int y,int w)
{
	a.m=m;d.m=m;
	bool fx=2*x<n,fy=2*y<m;
	if(fx)x=n-1-x;
	if(fy)y=m-1-y;
	flipped(n,m,x,y,w);
	if(fx)F(i,0,n>>1)F(j,0,m)swap(a[i][j],a[n-1-i][j]);
	if(fy)F(i,0,n)F(j,0,m>>1)swap(a[i][j],a[i][m-1-j]);
}
int n,m,x,y,w;
void solve()
{
	read(n,m,x,y,w);--x,--y;
	bool tr=false;
	if(n>m)transposed(m,n,y,x,w),tr=true;
	else transposed(n,m,x,y,w);
	if(a[0][0])
	{
		puts("Yes");
		F(i,0,n)
		{
			F(j,0,m)putchar(tr?a[j][i]:a[i][j]);
			puts("");
		}
	}
	else puts("No");
}
int main()
{
	int tt;read(tt);
	while(tt--)solve();
	return 0;
}