// G++ MACRO.CPP -STD=C++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;

#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl

#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)

#define FOREACH(x,a) for(auto& (x) : (a) )

#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])

#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl

#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl

#define ALL(obj) (obj).begin(),(obj).end()

#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)

template <class T = ll>
T IN(){T x;cin>>x;return (x);}

template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
  VECCIN(head);
  VT2(move(tail)...);
}

template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
  seco[head]=IN();
  VT3(head,move(tail)...);
}

#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc

// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int

#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int,V,greater<int>>

#define str string

#define pb(a) push_back(a)
#define mp make_pair

int main(){

  CIN(h,w,d);vector<V> a(h,V(w,0));
  REP(i,h)VECCIN(a[i]);
  CIN(q);VC2(q,l,r);

  P no = mp(-1,-1);
  vector<P> vec(h*w+1,mp(-1,-1));

  REP(i,h)REP(j,w)vec[a[i][j]] = mp(i,j);

  vector<ll> flag(h*w+1,-1);//探査済みか
  vector<vector<ll>> costs(h*w+1);//costs[i][j]:i番目からでj*d先
  REP(i,vec.size()){
    REP(j,INF){
      if(i + j*d > h*w)break;
      if(vec[i+j*d]==no)break;
      if(flag[i+j*d]!=-1)break;
      flag[i+j*d]=i;
      if(j==0){costs[i].pb(0);continue;}
      costs[i].pb(costs[i][j-1] + abs(vec[i+j*d].first-vec[i+(j-1)*d].first) +
                                    abs(vec[i+j*d].second-vec[i+(j-1)*d].second));
      /*
      dump(i+j*d);
      dump(abs(vec[i+j*d].first-vec[i+(j-1)*d].first) +
           abs(vec[i+j*d].second-vec[i+(j-1)*d].second));
      */

    }
  }
  /*
  REP(i,costs.size()){VECCOUT(costs[i]);}
  VECCOUT(flag);
  */
  REP(i,q){

    ll lnum = flag[l[i]];
    //ll rnum = flag[r[i]];
    ll diff = (r[i]-l[i])/d;
    //ll lp = (l[i] - flag[l[i]]) / d;
    ll rp = (r[i] - flag[r[i]]) / d;
    COUT(costs[lnum][rp]-costs[lnum][rp-diff]);

  }

  return 0;
}


Measured memory_bytes: 9728