#include 
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    int si, sj, ei, ej;
    char mat[n][m];
    bool visited1[n][m], visited2[n][m], visited3[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];

            if(mat[i][j] == 'P') {
                si = i;
                sj = j;
            }
            if(mat[i][j] == 'K') {
                ei = i;
                ej = j;
            }
            visited1[i][j] = false;
            visited2[i][j] = false;
            visited3[i][j] = false;
        }
    }

    int di1[] = {-1, 1, 0, 0};
    int dj1[] = {0, 0, -1, 1};
    int di2[] = {-2, 2, 0, 0};
    int dj2[] = {0, 0, -2, 2};
    int di3[] = {-3, 3, 0, 0};
    int dj3[] = {0, 0, -3, 3};


    queue q;
    q.push(si);
    q.push(sj);
    q.push(1);
    q.push(0);

    while(!q.empty()) {
        int ci = q.front();
        q.pop();
        int cj = q.front();
        q.pop();
        int vid_na_cekor = q.front();
        q.pop();
        int cekor = q.front();
        q.pop();

        if(ci == ei and cj == ej) {
            cout << cekor << endl;
            break;
        }
        if(vid_na_cekor == 1) {
            for(int i = 0; i < 4; i++) {
                int ti = ci + di1[i];
                int tj = cj + dj1[i];

                if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#' and !visited1[ti][tj]) {
                    q.push(ti);
                    q.push(tj);
                    q.push(2);
                    q.push(cekor + 1);
                    visited1[ti][tj] = true;
                }
            }
        }
        else if(vid_na_cekor == 2) {
            for(int i = 0; i < 4; i++) {
                int ti = ci + di1[i];
                int tj = cj + dj1[i];
                if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#') {
                    ti = ci + di2[i];
                    tj = cj + dj2[i];

                    if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#' and !visited2[ti][tj]) {
                        q.push(ti);
                        q.push(tj);
                        q.push(3);
                        q.push(cekor + 1);
                        visited2[ti][tj] = true;
                    }
                }
            }
        }
        else {
            for(int i = 0; i < 4; i++) {
                int ti = ci + di1[i];
                int tj = cj + dj1[i];
                if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#') {
                    ti = ci + di2[i];
                    tj = cj + dj2[i];
                    if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#') {
                        ti = ci + di3[i];
                        tj = cj + dj3[i];
                        if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#' and !visited3[ti][tj]) {
                            q.push(ti);
                            q.push(tj);
                            q.push(1);
                            q.push(cekor + 1);
                            visited3[ti][tj] = true;
                        }
                    }
                }
            }
        }
    }

    return 0;
}
/*

3
..#K#
.##.#
.....
...P.
**/