#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e3+5;
const int M=1e6+5;

struct Query {
	int x1,y1,x2,y2,id;
};
int n,m,Q,l[N][N];
bool a[N][N],ans[M];
bitset<N>b[N][N];
void solve(int l,int r,vector<Query>q) {
	if (q.empty()) {
		return;
	}
	if (l>=r) {
		return;
	}
	int mid=(l+r)/2;
	for (int i=m;i>=1;i--) {
		if (a[mid][i]) {
			b[mid][i]=b[mid][i+1];
			b[mid][i].set(i);
		} else {
			b[mid][i].reset();
		}
	}
	for (int i=mid-1;i>=l;i--) {
		for (int j=m;j>=1;j--) {
			b[i][j].reset();
			if (a[i][j]) {
				if (a[i+1][j]) {
					b[i][j]|=b[i+1][j];
				}
				if (a[i][j+1]) {
					b[i][j]|=b[i][j+1];
				}
			}
		}
	}
	for (int i=1;i<=m;i++) {
		if (a[mid+1][i]) {
			b[mid+1][i]=b[mid+1][i-1];
			b[mid+1][i].set(i);
		} else {
			b[mid+1][i].reset();
		}
	}
	for (int i=mid+2;i<=r;i++) {
		for (int j=1;j<=m;j++) {
			b[i][j].reset();
			if (a[i][j]) {
				if (a[i-1][j]) {
					b[i][j]|=b[i-1][j];
				}
				if (a[i][j-1]) {
					b[i][j]|=b[i][j-1];
				}
			}
		}
	}
	vector<Query>A,B;
	for (auto [x1,y1,x2,y2,id]:q) {
		if (x2<=mid) {
			A.emplace_back((Query){x1,y1,x2,y2,id});
		} else if (x1>mid) {
			B.emplace_back((Query){x1,y1,x2,y2,id});
		} else {
			ans[id]=(b[x1][y1]&b[x2][y2]).any();
		}
	}
	solve(l,mid,A);
	solve(mid+1,r,B);
}

signed main() {
	ios::sync_with_stdio(false),cin.tie(0);
	cout.precision(10),cout.setf(ios::fixed);
	
	cin>>n>>m>>Q;
	for (int i=1;i<=n;i++) {
		string s;
		cin>>s;
		for (int j=1;j<=m;j++) {
			a[i][j]=s[j-1]=='.';
			l[i][j]=a[i][j]?l[i][j-1]:j;
		}
	}
	vector<Query>q;
	for (int i=0;i<Q;i++) {
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		if (x1>x2||y1>y2) {
			ans[i]=0;
		} else if (x1==x2) {
			ans[i]=l[x2][y2]<y1;
		} else {
			q.emplace_back((Query){x1,y1,x2,y2,i});
		}
	}
	solve(1,n,q);
	for (int i=0;i<Q;i++) {
		if (ans[i]) {
			cout<<"YES\n";
		} else {
			cout<<"NO\n";
		}
	}
	
	return 0;
}