#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define PI (acos(-1))
template<typename T> inline T power(T x, T n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

constexpr ll HW_MAX = 300;
constexpr ll Q_MAX = 100000;

ll H, W, D;
ll A[HW_MAX][HW_MAX];
ll Q;
ll L[Q_MAX];
ll R[Q_MAX];

void input() {
	scanf("%lld%lld%lld", &H, &W, &D);
	rep(i, H) rep(j, W) scanf("%lld", &A[i][j]);
	scanf("%lld", &Q);
	//rep(i, Q) scanf("%lld%lld", L + i, R + i);
}

void solve2() {
	map<ll,pair<ll,ll>> m;
	rep(i, H) rep(j, W) {
		m[A[i][j]]=make_pair(i,j);
	}
	while(Q--){
		ll l,r;
		scanf("%lld%lld", &l, &r);
		ll i=l;
		pair<ll,ll> p;
		p=m[l];
		ll count=0;
		while(i<r){
			i+=D;
			auto q=m[i];
			count+=abs(p.first-q.first)+abs(p.second-q.second);
			p=q;
		}
		p(count);
	}
 
}

void solve() {
	map<ll,pair<ll,ll>> m;
	rep(i, H) rep(j, W) {
		m[A[i][j]]=make_pair(i,j);
	}
	debug(m);
	//ll rui[HW_MAX][H*W+1];
	vector<vector<ll>> rui(D+1,vector<ll>(H*W+1,0));
	repeq(l,D){
		ll i=l;
		pair<ll,ll> p;
		p=m[l];
		ll count=0;
		while(true){
			debug(i);
			i+=D;
			if(i>H*W)break;
			auto q=m[i];
			count+=abs(p.first-q.first)+abs(p.second-q.second);
			rui[l][i]=count;
			p=q;
		}
	}
	debug(rui);
	while(Q--){
		ll l,r;
		scanf("%lld%lld", &l, &r);
		ll mod=l%D;
		if(mod==0)mod=D;
		ll count=rui[mod][r]-rui[mod][l];
		p(count);
	}

}

signed main() {
	input();
	if(D<H*W*0.6)solve();
	else solve2();
	return 0;
}


Measured memory_bytes: 186112