#include <bits/stdc++.h>
using namespace std;

#define int long long


map<char,int> lookup = {{'P',0},{'C',1},{'Z',2},{'N',3}};

int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n,m;
	cin >> n >> m;
	vector rightDoor(n+1,vector<int>(m+1,4));
	vector downDoor(n+1,vector<int>(m+1,4));
	for(int i=1;i<=n;i++){
		for(int j=1;j<m;j++){
			char x;cin>>x;
			rightDoor[i][j]=lookup[x];
		}
	}
	for(int i=1;i<n;i++){
		for(int j=1;j<=m;j++){
			char x;cin>>x;
			downDoor[i][j]=lookup[x];
		}
	}
	vector component(16,vector(n+1,vector(m+1,-1)));
	function<void(int,int,int,int)> dfs = [&](int x,int y,int kind,int compo){
		if(component[kind][x][y]!=-1)return;
		component[kind][x][y]=compo;
		if(kind&(1<<rightDoor[x][y]))dfs(x,y+1,kind,compo);
		if(kind&(1<<rightDoor[x][y-1]))dfs(x,y-1,kind,compo);
		if(kind&(1<<downDoor[x][y]))dfs(x+1,y,kind,compo);
		if(kind&(1<<downDoor[x-1][y]))dfs(x-1,y,kind,compo);
	};
	for(int kind = 0;kind<16;kind++){
		int components = 0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(component[kind][i][j]!=-1)continue;
				dfs(i,j,kind,++components);
			}
		}
	}
	int q;
	cin >> q;
	for(int i=1;i<=q;i++){
		int a,b,c,d;cin>>a>>b>>c>>d;
		int ans = 5;
		for(int kind=0;kind<16;kind++){
			if(component[kind][a][b]==component[kind][c][d])ans=min(ans,(int)__builtin_popcount(kind));
		}
		cout << ans << '\n';
	}
}