Problem:
Score : 400 points

Problem Statement

We have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).

The integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.

You, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.

You now have to take Q practical tests of your ability as a magical girl.

The i-th test will be conducted as follows:

Initially, a piece is placed on the square where the integer L_i is written.

Let x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.

Here, it is guaranteed that R_i-L_i is a multiple of D.

For each test, find the sum of magic points consumed during that test.

Constraints

1 \leq H,W \leq 300

1 \leq D \leq H×W

1 \leq A_{i,j} \leq H×W

A_{i,j} \neq A_{x,y} ((i,j) \neq (x,y))

1 \leq Q \leq 10^5

1 \leq L_i \leq R_i \leq H×W

(R_i-L_i) is a multiple of D.

Input

Input is given from Standard Input in the following format:

H W D
A_{1,1} A_{1,2} ... A_{1,W}
:
A_{H,1} A_{H,2} ... A_{H,W}
Q
L_1 R_1
:
L_Q R_Q

Output

For each test, print the sum of magic points consumed during that test.

Output should be in the order the tests are conducted.

Sample Input 1

3 3 2
1 4 3
2 5 7
8 9 6
1
4 8

Sample Output 1

5

4 is written in Square (1,2).

6 is written in Square (3,3).

8 is written in Square (3,1).

Thus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.

Sample Input 2

4 2 3
3 7
1 4
5 2
6 8
2
2 2
2 2

Sample Output 2

0
0

Note that there may be a test where the piece is not moved at all, and there may be multiple identical tests.

Sample Input 3

5 5 4
13 25 7 15 17
16 22 20 2 9
14 11 12 1 19
10 6 23 8 18
3 21 5 24 4
3
13 13
2 10
13 13

Sample Output 3

0
5
0

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;

namespace Contest
{
    class Scanner
    {
        private string[] line = new string[0];
        private int index = 0;
        public string Next()
        {
            if (line.Length <= index)
            {
                line = Console.ReadLine().Split(' ');
                index = 0;
            }
            var res = line[index];
            index++;
            return res;
        }
        public int NextInt()
        {
            return int.Parse(Next());
        }
        public long NextLong()
        {
            return long.Parse(Next());
        }
        public string[] Array()
        {
            line = Console.ReadLine().Split(' ');
            index = line.Length;
            return line;
        }
        public int[] IntArray()
        {
            return Array().Select(int.Parse).ToArray();
        }
        public long[] LongArray()
        {
            return Array().Select(long.Parse).ToArray();
        }
    }
    struct SS
    {
        public int X, Y;
        public SS(int x, int y)
        {
            X = x;
            Y = y;
        }
    }



    class Program
    {
        private int H, W;
        private int D;
        private int[,] A;
        private int Q;
        private int[] L, R;
        private int N;
        private Dictionary<int, SS> Map = new Dictionary<int, SS>();
        private void Scan()
        {
            var sc = new Scanner();
            H = sc.NextInt();
            W = sc.NextInt();
            D = sc.NextInt();
            A = new int[H, W];
            for (int i = 0; i < H; i++)
            {
                for (int j = 0; j < W; j++)
                {
                    A[i, j] = sc.NextInt();
                }
            }
            Q = sc.NextInt();
            L = new int[Q];
            R = new int[Q];
            for (int i = 0; i < Q; i++)
            {
                L[i] = sc.NextInt();
                R[i] = sc.NextInt();
            }
        }

        private int Dist(int i, int j)
        {
            var a = Map[i];
            var b = Map[j];
            return Math.Abs(a.X - b.X) + Math.Abs(a.Y - b.Y);
        }

        public void Solve()
        {
            Scan();
            int N = H * W;
            for (int i = 0; i < H; i++)
            {
                for (int j = 0; j < W; j++)
                {
                    Map[A[i, j]] = new SS(j, i);
                }
            }
            var ans = new long[N + 1, N + 1];
            for (int i = 0; i <= N; i++)
            {
                for (int j = 0; j <= N; j++)
                {
                    ans[i, j] = int.MaxValue;
                }
            }
            for (int i = 1; i <= N - D; i++)
            {
                ans[i, i + D] = Dist(i, i + D);
            }
            for (int i = 1; i <= D; i++)
            {
                for (int k = i; k <= N; k += D)
                {
                    for (int j = i; j <= N; j += D)
                    {
                        for (int l = i; l <= N; l += D)
                        {
                            ans[j, l] = Math.Min(ans[j, l], ans[j, k] + ans[k, l]);
                        }
                    }
                }
            }
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
            for (int i = 0; i < Q; i++)
            {
                if (L[i] == R[i])
                {
                    Console.WriteLine("0");
                    continue;
                }
                Console.WriteLine(ans[L[i], R[i]].ToString());
            }
            Console.Out.Flush();
        }

        static void Main(string[] args)
        {
            new Program().Solve();
        }
    }
}