using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int H = cin.nextint;
        int W = cin.nextint;
        int D = cin.nextint;


        var X = new int[H * W];
        var Y = new int[H * W];
        for (int i = 0; i < H * W; i++)
        {
            X[i] = -1;
            Y[i] = -1;
        }
        for (int i = 0; i < H; i++)
        {
            for (int j = 0; j < W; j++)
            {
                int t = cin.nextint - 1;
                X[t] = i;
                Y[t] = j;
            }
        }
        var Z = new List<int>[D];
        for (int i = 0; i < D; i++)
        {
            Z[i] = new List<int>();
            Z[i].Add(0);
        }
        for (int i = 0; i < D; i++)
        {
            for (int j = 1; i + j * D < H * W; j++)
            {
                int p = i + j * D;
                int q = i + (j - 1) * D;
                Z[i].Add(Abs(X[p] - X[q]) + Abs(Y[p] - Y[q]));
            }
            for (int j = 1; j < Z[i].Count; j++)
            {
                Z[i][j] += Z[i][j - 1];
            }
        }

        int Q = cin.nextint;
        for (int i = 0; i < Q; i++)
        {
            int L = cin.nextint - 1;
            int R = cin.nextint - 1;

            int d = L % D;
            int p = L / D;
            int q = R / D;

            WriteLine(Z[d][q] - Z[d][p]);
        }
    }

}


class WarshallFloyd
{
    public readonly long Inf;
    public WarshallFloyd(long Inf = long.MaxValue / 2) { this.Inf = Inf; }

    /// <summary>
    /// WarshallFloydな入力を行う
    /// </summary>
    /// <param name="n">頂点数</param>
    /// <param name="m">辺数</param>
    /// /// <param name="dir">有向/無向 デフォルト: 無向</param>
    /// <param name="indexed">indexedの補正 デフォルト: 1</param>
    /// <returns>n*nの自明な距離行列</returns>
    public long[][] Input(int n, int m, bool dir = false, int indexed = 1, bool cost = true)
    {
        Scanner cin = new Scanner();
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[n];
            for (int j = 0; j < n; j++)
            {
                if (i != j)
                {
                    ret[i][j] = Inf;
                }
            }
        }
        for (int i = 0; i < m; i++)
        {
            int a = cin.nextint - indexed;
            int b = cin.nextint - indexed;
            var c = true ? cin.nextlong : 1;
            ret[a][b] = Min(ret[a][b], c);
            if (!dir) ret[b][a] = Min(ret[b][a], c);
        }
        return ret;
    }
    public long[][] Run(long[][] d)
    {
        int n = d.Length;
        for (int k = 0; k < n; k++)
        {
            for (int i = 0; i < n; i++)
            {
                if (d[i][k] == Inf) continue;
                for (int j = 0; j < n; j++)
                {
                    if (d[k][j] == Inf) continue;
                    d[i][j] = Min(d[i][j], d[i][k] + d[k][j]);
                }
            }
        }
        return d;
    }
    /// <summary>
    /// n*n距離行列が与えられるときに変換に便利
    /// </summary>
    /// <param name="g">n*n距離行列</param>
    /// <param name="param">辺がないときのパラメタ</param>
    /// <returns></returns>
    public long[][] Copy(long[][] g, long param = 0)
    {
        int n = g.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[n];
            for (int j = 0; j < n; j++)
            {
                if (i != j && g[i][j] == param) ret[i][j] = Inf;
                else ret[i][j] = g[i][j];
            }
        }
        return ret;
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 23036