import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;

alias Pair = Tuple!(int, "i", int, "j");

void main() {
    int H, W, D;
    scan(H, W, D);
    auto a = iota(H).map!(i => readln.split.to!(int[])).array;
    auto p = new Pair[](H*W + 1);
    foreach (i ; 0 .. H) {
        foreach (j ; 0 .. W) {
            p[a[i][j]] = Pair(i, j);
        }
    }

    auto dis(int x, int y) {
        return abs(p[x].i - p[y].i) + abs(p[x].j - p[y].j);
    }
    auto r = new long[](H*W + 1);
    foreach (i ; D + 1 .. H * W + 1) {
        r[i] = r[i - D] + dis(i, i - D);
    }

    int Q;
    scan(Q);

    foreach (_ ; 0 .. Q) {
        int li, ri;
        scan(li, ri);
        auto ans = r[ri] - r[li];
        writeln(ans);
    }
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
