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 Rust (1.15.1) (judge verdict: Wrong Answer)

pub fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

pub fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

pub fn read_vec2<T: std::str::FromStr>(n: usize) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

pub fn read_col<T: std::str::FromStr>(n: usize) -> Vec<T> {
    (0..n).map(|_| read()).collect()
}

fn abs(a: usize, b: usize) -> usize {
    if a > b {
        a - b
    } else {
        b - a
    }
}

fn main() {
    let hwd: Vec<usize> = read_vec();
    let h = hwd[0];
    let w = hwd[1];
    let d = hwd[2] as usize;
    let mat: Vec<Vec<usize>> = read_vec2(h);
    let hw = h * w;
    let mut axis: Vec<(usize, usize)> = vec![(0, 0); hw];
    for i in 0..h {
        for j in 0..w {
            axis[mat[i][j] - 1] = (i, j);
        }
    }

    let mut mp: Vec<u32> = vec![0; hw];

    if hw % d == 0 {
        for _ in 0..d {
            let mut j = 0;
            let mut tmp = 0;
            loop {
                let nj = (j + d) % hw;
                tmp += abs(axis[nj].0, axis[j].0) + abs(axis[nj].1, axis[j].1);
                mp[nj] = tmp as u32;
                j = nj;
                if j == 0 {
                    break;
                }
            }
        }
    } else {
        let mut j = 0;
        let mut tmp = 0;
        loop {
            let nj = (j + d) % hw;
            tmp += abs(axis[nj].0, axis[j].0) + abs(axis[nj].1, axis[j].1);
            mp[nj] = tmp as u32;
            j = nj;
            if j == 0 {
                break;
            }
        }
    }

    let q: usize = read();
    let mut ans = vec![0; q];
    for i in 0..q {
        let lr: Vec<usize> = read_vec();
        let l = lr[0] - 1;
        let r = lr[1] - 1;
        ans[i] = mp[r] - mp[l];
    }

    for a in ans {
        println!("{}", a);
    }
}