#include <bits/stdc++.h>#define gc getchar()#define ll long long#define mid (l+r>>1)#define N 509usingnamespacestd;
int n,m,a[N][N],Q;
struct qry
{
bitset<N> dp[N][N][2];
void get_dp(int l,int r)
{
for (int i=1;i<=n;i++)
for (int j=l;j<=r;j++) dp[i][j][0]&=0,dp[i][j][1]&=0;
for (int i=1;i<=n;i++)
if (a[i][mid])
{
dp[i][mid][0][i]=1;
if (i&&a[i-1][mid]) dp[i][mid][0]|=dp[i-1][mid][0];
}
for (int i=n;i;i--)
if (a[i][mid])
{
dp[i][mid][1][i]=1;
if (i<n&&a[i+1][mid]) dp[i][mid][1]|=dp[i+1][mid][1];
}
for (int i=n;i;i--)
for (int j=mid-1;j>=l;j--)
if (a[i][j])
{
if (i<n&&a[i+1][j]) dp[i][j][1]|=dp[i+1][j][1];
if (a[i][j+1]) dp[i][j][1]|=dp[i][j+1][1];
}
for (int i=1;i<=n;i++)
for (int j=mid+1;j<=r;j++)
if (a[i][j])
{
if (i>1&&a[i-1][j]) dp[i][j][0]|=dp[i-1][j][0];
if (a[i][j-1]) dp[i][j][0]|=dp[i][j-1][0];
}
}
}q[10];
int read()
{
int x=1;
char ch;
while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
int s=ch-'0';
while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-'0';
return s*x;
}
void solve(int l,int r,int k)
{
if (l>r) return;
q[k].get_dp(l,r);
if (l==r) return;
solve(l,mid-1,k+1);
solve(mid+1,r,k+1);
}
void get_Ans(int l,int r,int k,int x1,int y1,int x2,int y2)
{
if (y1<=mid&&y2>=mid)
{
//cout<<q[k].dp[x1][y1]<<endl<<q[k].dp[x2][y2]<<endl;puts(((q[k].dp[x1][y1][1]&q[k].dp[x2][y2][0]).any()>0)?"Yes":"No");
return;
}
if (y2<mid) get_Ans(l,mid-1,k+1,x1,y1,x2,y2);
else get_Ans(mid+1,r,k+1,x1,y1,x2,y2);
}
int main()
{
n=read(),m=read();
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
char ch;
while (ch=gc,ch!='.'&&ch!='#');
a[i][j]=(ch=='.');
}
solve(1,m,0);
Q=read();
while (Q--)
{
int x1=read(),y1=read(),x2=read(),y2=read();
if (y1>y2) swap(x1,x2),swap(y1,y2);
if (y1==y2&&x1>x2) swap(x1,x2);
get_Ans(1,m,0,x1,y1,x2,y2);
}
return0;
}