Problem:
Score : 600 points

Problem Statement

Snuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.

Some of the squares have a lotus leaf on it and cannot be entered.
The square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..

In one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.
The move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.

Find the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).
If the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.

Constraints

1 \leq H,W,K \leq 10^6

H \times W \leq 10^6

1 \leq x_1,x_2 \leq H

1 \leq y_1,y_2 \leq W

x_1 \neq x_2 or y_1 \neq y_2.

c_{i,j} is . or @.

c_{x_1,y_1} = .

c_{x_2,y_2} = .

All numbers in input are integers.

Input

Input is given from Standard Input in the following format:

H W K
x_1 y_1 x_2 y_2
c_{1,1}c_{1,2} .. c_{1,W}
c_{2,1}c_{2,2} .. c_{2,W}
:
c_{H,1}c_{H,2} .. c_{H,W}

Output

Print the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.

Sample Input 1

3 5 2
3 2 3 4
.....
.@..@
..@..

Sample Output 1

5

Initially, Snuke is at the square (3,2).
He can reach the square (3, 4) by making five strokes as follows:

From (3, 2), go west one square to (3, 1).

From (3, 1), go north two squares to (1, 1).

From (1, 1), go east two squares to (1, 3).

From (1, 3), go east one square to (1, 4).

From (1, 4), go south two squares to (3, 4).

Sample Input 2

1 6 4
1 1 1 6
......

Sample Output 2

2

Sample Input 3

3 3 1
2 1 2 3
.@.
.@.
.@.

Sample Output 3

-1

Solution in Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Main {
    int k;
    int h;
    int w;
    boolean[][] obstacle;

    public static void main(String[] args) throws IOException {
        new Main().solve();
    }

    private void solve() throws IOException {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer tokenizer = new StringTokenizer(f.readLine());
        h = Integer.parseInt(tokenizer.nextToken());
        w = Integer.parseInt(tokenizer.nextToken());
        k = Integer.parseInt(tokenizer.nextToken());
        tokenizer = new StringTokenizer(f.readLine());
        int x1 = Integer.parseInt(tokenizer.nextToken()) - 1;
        int y1 = Integer.parseInt(tokenizer.nextToken()) - 1;
        int x2 = Integer.parseInt(tokenizer.nextToken()) - 1;
        int y2 = Integer.parseInt(tokenizer.nextToken()) - 1;

        obstacle = new boolean[h][w];
        for (int i = 0; i < h; i++) {
            char[] line = f.readLine().toCharArray();
            for (int j = 0; j < w; j++) {
                if (line[j] == '@') {
                    obstacle[i][j] = true;
                }
            }
        }

        int[][] shortestPath = new int[h][w];
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                shortestPath[i][j] = Integer.MAX_VALUE;
            }
        }
        PriorityQueue<Node> pq = new PriorityQueue<Node>();
        pq.add(new Node(x1, y1, 0, 0, 0));
        boolean[][][] visited = new boolean[h][w][4];
        while(!pq.isEmpty()) {
            Node node = pq.remove();
            //System.out.println(node.x + 1 +  " " + (node.y + 1) + " " + node.direction + " " + node.path + " " + node.part);
            if (visited[node.x][node.y][node.direction]) {
                continue;
            }
            visited[node.x][node.y][node.direction] = true;
            int length = node.path;
            if (node.part != 0) {
                length++;
            }
            shortestPath[node.x][node.y] = Math.min(shortestPath[node.x][node.y], length);
            int dx = Integer.MAX_VALUE;
            int dy = Integer.MAX_VALUE;
            if (node.direction == 0) {
                dx = -1;
                dy = 0;
            } else if (node.direction == 1) {
                dx = 1;
                dy = 0;
            } else if (node.direction == 2) {
                dx = 0;
                dy = -1;
            } else if (node.direction == 3) {
                dx = 0;
                dy = 1;
            }
            if (coordIsLegal(node.x + dx, node.y + dy)) {
                pq.add(new Node(node.x + dx, node.y + dy, node.path, node.part + 1, node.direction));
            }

            for (int i = 0; i < 4; i++) {
                pq.add(new Node(node.x, node.y, length, 0, i));
            }
        }

        if (shortestPath[x2][y2] == Integer.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(shortestPath[x2][y2]);
        }
    }

    private boolean coordIsLegal(int x, int y) {
        if (x < 0 || y < 0 || x >= h || y >= w) {
            return false;
        }
        if (obstacle[x][y]) {
            return false;
        }

        return true;
    }


    private  class Node implements Comparable<Node> {
        int x;
        int y;
        int direction;
        int path;
        int part;

        public Node(int x1, int y1, int path, int part, int direction) {
            this.x = x1;
            this.y = y1;
            if (part == k) {
                part = 0;
                path++;
            }
            this.path = path;
            this.part = part;
            this.direction = direction;
        }

        @Override
        public int compareTo(Node node) {
            if (this.path < node.path) {
                return -1;
            }
            if (this.path > node.path) {
                return 1;
            }
            if (this.part < node.part) {
                return -1;
            }
            if (this.part > node.part) {
                return 1;
            }

            return 0;
        }
    }
}