#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os<<"{"<<p.ff<<", "<<p.ss<<"}";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (size_t i = 0; i < v.size(); ++i) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
template<ll MOD=998244353>
struct mint_t{
ll x;
mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
mint_t fp(ll y)const{
mint_t a=1,b=x;
while(y){
if(y&1)a*=b;
b*=b;
y/=2;
}
return a;
}
mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
ll x;
in>>x;
a=mint_t<MOD>(x);
return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
out<<a.x;
return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
if(b>a || a<0)return 0;
return fct[a]/fct[b]/fct[a-b];
}
#define X 20
ll h,w,l,q,a,b,c,d;
vvi pl;
ll mj[300007];
pii mx[300007];
ll ns[300007];
unordered_set<ll>s[300007];
ll nx[300007][X];
ll fnd(ll x){
return mj[x]==x?x:mj[x]=fnd(mj[x]);
}
vi zap;
void onion(ll a,ll b){
a=fnd(a);b=fnd(b);
if(a==b)return;
if(s[a].size()>s[b].size()){
swap(s[a],s[b]);
}
mx[fnd(b)]=max(mx[fnd(b)],mx[fnd(a)]);
for(ll i : s[a]){
if(s[b].find(i)!=s[b].end()){
s[b].erase(i);
ns[i]=mx[b].ff;
}
else s[b].insert(i);
}
mj[fnd(a)]=fnd(b);
}
vi pl2;
void solve(){
cin>>h>>w>>l;
vector<pair<ll,pii>>v;
for(ll i=0;i<h;i++){
pl.pb({});
for(ll j=0;j<w;j++){
cin>>a;pl.back().pb(a);pl2.pb(a);
v.pb({a,{i,j}});
mj[i*w+j]=i*w+j;
mx[i*w+j]={a,i*w+j};
}
}
cin>>q;
for(ll i=0;i<q;i++){
cin>>a>>b>>c>>d;
a--;b--;c--;d--;
s[a*w+b].insert(i);
s[c*w+d].insert(i);
zap.pb(a*w+b);
}
sort(al(v));
v.pb({INFL,{-1,-1}});
ll p1=0;
for(ll i=0;i<v.size();i++){
while(v[p1].ff+l<v[i].ff){
nx[v[p1].ss.ff*w+v[p1].ss.ss][0]=mx[fnd(v[p1].ss.ff*w+v[p1].ss.ss)].ss;
p1++;
}
if(i==v.size()-1)break;
ll x=v[i].ss.ff,y=v[i].ss.ss;
if(x && pl[x-1][y]<=v[i].ff)onion(x*w+y,x*w-w+y);
if(y && pl[x][y-1]<=v[i].ff)onion(x*w+y,x*w+y-1);
if(x+1<h && pl[x+1][y]<=v[i].ff)onion(x*w+y,x*w+w+y);
if(y+1<w && pl[x][y+1]<=v[i].ff)onion(x*w+y,x*w+y+1);
}
for(ll i=0;i<h*w;i++)if(nx[i][0]<0)nx[i][0]=i;
for(ll j=1;j<X;j++){
for(ll i=0;i<h*w;i++)nx[i][j]=nx[nx[i][j-1]][j-1];
}
for(ll i=0;i<q;i++){
if(pl2[nx[zap[i]][X-1]]<ns[i])cout<<"-1\n";
else{
ll ak=0;
for(ll j=X-2;j+1;j--){
if(pl2[nx[zap[i]][j]]<ns[i]){
ak+=(1<<j);
zap[i]=nx[zap[i]][j];
}
}
cout<<ak+1<<"\n";
}
}
}
int main(){
fct[0]=1;
for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
