#include <bits/stdc++.h>
using namespace std;
bool contains(vector<int> v, int num) {
for (auto i : v) {
if (i == num) {
return true;
}
}
return false;
}
int main() {
int n, m, q, ekay, ekax, tokay, tokax;
string row;
cin >> n >> m >> q;
vector<string> grid;
vector<int> nodesInColumns[m];
vector<vector<pair<int, pair<vector<int>, vector<int>>>>> row_kaaret(n);
vector<vector<pair<int, vector<pair<vector<int>,vector<int>>>>>> d(n);
for (int index = 0; index < n; index++) {
vector<pair<int,pair<vector<int>,vector<int>>>> v(n, {0, {}});
row_kaaret[index] = v;
vector<pair<int, vector<pair<vector<int>,vector<int>>>>> j(n);
d[index] = j;
}
map<map<map<map<int>>>> answers;
for (int index = 0; index < n; index++) {
for (int jndex = index; jndex < n; jndex++) {
for (int i = 0; i < m; i++) {
for (int j = i; j < m; j++) {
answers[index][jndex][i][j] = -2;
}
}
}
}
for (int index = 0; index < n; index++) {
cin >> row;
grid.push_back(row);
for (int col = 0; col < m; col++) {
if (grid[index][col] == '.') {
nodesInColumns[col].push_back(index);
}
}
}
for (int index = 0; index < m; index++) {
for (auto node : nodesInColumns[index]) {
for (auto node2 : nodesInColumns[index]) {
if (node < node2) {
row_kaaret[node][node2].first = 1;
row_kaaret[node][node2].second.first.push_back(index);
row_kaaret[node][node2].second.second.push_back(index);
}
}
}
}
//floyd
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) d[i][j].first = 0;
else if (i < j && row_kaaret[i][j].first != 0) {
d[i][j].first = row_kaaret[i][j].first;
pair<vector<int>,vector<int>> p = row_kaaret[i][j].second;
d[i][j].second.push_back(p);
}
else d[i][j].first = 1e9;
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (d[i][j].first > d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first) {
d[i][j].first = d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first;
if (i < k) row_kaaret[i][j].second.first = row_kaaret[i][k].second.first;
else row_kaaret[i][j].second.first = row_kaaret[k][i].second.second;
if (k < j) row_kaaret[i][j].second.second = row_kaaret[k][j].second.second;
else row_kaaret[i][j].second.second = row_kaaret[j][k].second.first;
pair<vector<int>,vector<int>> p;
if (i < k) p.first = row_kaaret[i][k].second.first;
else p.first = row_kaaret[k][i].second.second;
if (k < j) p.second = row_kaaret[k][j].second.second;
else p.second = row_kaaret[j][k].second.first;
d[i][j].second.clear();
if ((int) p.first.size() != 0 && (int) p.second.size() != 0) d[i][j].second.push_back(p);
} else if (d[i][j].first == d[min(i,k)][max(i,k)].first + d[min(k,j)][max(k,j)].first) {
if (i < k) row_kaaret[i][j].second.first.insert(row_kaaret[i][j].second.first.end(), row_kaaret[i][k].second.first.begin(), row_kaaret[i][k].second.first.end());
else row_kaaret[i][j].second.first.insert(row_kaaret[i][j].second.first.end(), row_kaaret[k][i].second.second.begin(), row_kaaret[k][i].second.second.end());
if (k < j) row_kaaret[i][j].second.second.insert(row_kaaret[i][j].second.second.end(), row_kaaret[k][j].second.second.begin(), row_kaaret[k][j].second.second.end());
else row_kaaret[i][j].second.second.insert(row_kaaret[i][j].second.second.end(), row_kaaret[j][k].second.first.begin(), row_kaaret[j][k].second.first.end());
pair<vector<int>,vector<int>> p;
if (i < k) p.first = row_kaaret[i][k].second.first;
else p.first = row_kaaret[k][i].second.second;
if (k < j) p.second = row_kaaret[k][j].second.second;
else p.second = row_kaaret[j][k].second.first;
if ((int) p.first.size() != 0 && (int) p.second.size() != 0) d[i][j].second.push_back(p);
}
}
}
}
//kyselyt
for (int index = 0; index < q; index++) {
cin >> ekay >> ekax >> tokay >> tokax;
int y1 = tokay;
int y2 = ekay;
int x1 = tokax;
int x2 = ekax;
if (ekay < tokay) {
y1 = ekay;
y2 = tokay;
x1 = ekax;
x2 = tokax;
}
if (y1 == y2 && x1 == x2) cout << 0 << endl;
else if (y1 == y2 || x1 == x2) cout << 1 << endl;
else {
pair<int, vector<pair<vector<int>,vector<int>>>> dist = d[y1-1][y2-1];
if (dist.first >= 1e9) cout << -1 << endl;
//else if (answers[y1-1][y2-1][x1-1][x2-1] != -2) cout << answers[y1-1][y2-1][x1-1][x2-1] << endl;
else {
if (dist.first == 1) {
vector<int> v = row_kaaret[y1-1][y2-1].second.first;
vector<int> v2 = row_kaaret[y1-1][y2-1].second.second;
bool c1 = contains(v,x1-1);
bool c2 = contains(v2,x2-1);
if (c1 != false || c2 != false) {
cout << dist.first + dist.first-1 + 1 << endl;
//answers[y1-1][y2-1][x1-1][x2-1] = dist.first + dist.first-1 + 1;
}
else if (c1 == false && c2 == false) {
cout << dist.first + dist.first-1 + 2 << endl;
//answers[y1-1][y2-1][x1-1][x2-1] = dist.first + dist.first-1 + 2;
}
} else {
int a = 0, b = 0;
for (auto pset : dist.second) {
bool s1 = contains(pset.first,x1-1);
if (s1) {
bool s2 = contains(pset.second, x2-1);
if (s2) {
a = 1;
break;
}
b = 1;
} else if (b == 0) {
bool s2 = contains(pset.second, x2-1);
if (s2) b = 1;
}
}
if (a == 1) {
cout << dist.first + dist.first-1 << endl;
//answers[y1-1][y2-1][x1-1][x2-1] = dist.first + dist.first-1;
}
else if (b == 1) {
cout << dist.first + dist.first-1 + 1 << endl;
//answers[y1-1][y2-1][x1-1][x2-1] = dist.first + dist.first-1 + 1;
}
else {
cout << dist.first + dist.first-1 + 2 << endl;
//answers[y1-1][y2-1][x1-1][x2-1] = dist.first + dist.first-1 + 2;
}
}
}
}
}
}
