#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

int main()
{
    cout << fixed << setprecision(30);
    ll H, W, D;
    cin >> H >> W >> D;
    vector<vector<ll>> field(H, vector<ll>(W));
    vector<pair<ll, ll>> xy(H * W); //座標を数字から逆算できるようにする
    loop(i, H) loop(j, W)
    {
        cin >> field[i][j];
        field[i][j]--;
        xy[field[i][j]] = make_pair(i, j);
    }
    ll Q;
    cin >> Q;
    vec L(Q), R(Q);
    loop(i, Q)
    {
        cin >> L[i] >> R[i];
        L[i]--;
        R[i]--;
    }
    vector<vector<ll>> costs(D);
    loop(i, D) costs[i].push_back(0);
    loop(i, D)
    {
        ll now = i;
        ll next = i + D;
        ll nowcost = 0;
        while (next < H * W)
        {
            ll nowx = xy[now].first, nowy = xy[now].second;
            ll nextx = xy[next].first, nexty = xy[next].second;
            ll cost = abs(nowx - nextx) + abs(nowy - nexty);
            nowcost += cost;
            costs[i].push_back(nowcost);
            now = next;
            next += D;
        }
    }
    loop(i, Q)
    {
        ll start = L[i];
        while (start >= D)
        {
            start -= D;
        }
        ll nl, nr;
        nl = (L[i] - start) / D;
        nr = (R[i] - start) / D;
        putout(costs[start][nr] - costs[start][nl]);
    }
    return 0;
}


Measured memory_bytes: 11864