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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;

class Main {
	public static void main(String args[]) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		Solver solver = new Solver();
		solver.init();
		solver.readHead(in.readLine());
		for (; solver.hasNext();) {
			solver.readBody(in.readLine());
		}
		solver.readQ(in.readLine());
		for (; solver.hasQ();) {
			solver.solve(in.readLine());
		}
	}
}

class Solver {
	int H;
	int W;
	int D;
	int cnt;

	public void init() {
		H = 0;
		W = 0;
		D = 0;
		cnt = 0;
	}

	int[][] A;

	public void readHead(String str) {
		String[] strArr = str.split(" ");
		H = Integer.parseInt(strArr[0]);
		W = Integer.parseInt(strArr[1]);
		D = Integer.parseInt(strArr[2]);
		A = new int[H][W];
	}

	public boolean hasNext() {
		return cnt < H;
	}

	public void readBody(String str) {
		// System.out.println(str);
		String[] strArr = str.split(" ");
		for (int i = 0; i < W; i++)
			A[cnt][i] = Integer.parseInt(strArr[i]);
		cnt++;
	}

	private class Cell {
		int X;
		int Y;

		public Cell(int x, int y) {
			super();
			X = x;
			Y = y;
		}

		@Override
		public String toString() {
			return "Cell [X=" + X + ", Y=" + Y + "]";
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + X;
			result = prime * result + Y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Cell other = (Cell) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (X != other.X)
				return false;
			if (Y != other.Y)
				return false;
			return true;
		}

		private Solver getOuterType() {
			return Solver.this;
		}

	}

	int Q;
	HashMap<Integer, Cell> CellMap;

	private class Ans {
		int L;
		int R;

		public Ans(int l, int r) {
			super();
			L = l;
			R = r;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + L;
			result = prime * result + R;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Ans other = (Ans) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (L != other.L)
				return false;
			if (R != other.R)
				return false;
			return true;
		}

		private Solver getOuterType() {
			return Solver.this;
		}

	}

	HashMap<Ans, Integer> Mem;

	public void readQ(String str) {
		Q = Integer.parseInt(str);
		cnt = 0;
		CellMap = new HashMap<Integer, Cell>();
		for (int h = 0; h < H; h++) {
			for (int w = 0; w < W; w++) {
				CellMap.put(A[h][w], new Cell(h, w));
			}
		}
		Mem = new HashMap<Ans, Integer>();
	}

	public boolean hasQ() {
		return cnt < Q;
	}

	public void solve(String str) {
		cnt++;
		// for (int h = 0; h < H; h++) {
		// for (int w = 0; w < W; w++)
		// System.out.printf(" %3d", A[h][w]);
		// System.out.println();
		// }

		String[] strArr = str.split(" ");
		int L = Integer.parseInt(strArr[0]);
		int R = Integer.parseInt(strArr[1]);
		Ans a = new Ans(L, R);
		if (Mem.containsKey(a)) {
			System.out.println(Mem.get(a));
			return;
		}

		Cell pc = CellMap.get(L);
		int ans = 0;
		for (int n = L; n <= R; n += D) {
			// System.out.println(CellMap.get(n));
			Cell nc = CellMap.get(n);
			ans += Math.abs(nc.X - pc.X);
			ans += Math.abs(nc.Y - pc.Y);
			pc = nc;
		}
		Mem.put(a, ans);
		System.out.println(ans);
	}
}