#include <iostream>
#include <string.h>

using namespace std;
enum{y,x};

int k;
int w, h;
int cache[201][201][31];
int map[213][213];
int dir_ord[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 }, };
int dir_hor[8][2] = { { 1,2 },{ -1,2 },{ 1,-2 },{ -1,-2 },{ 2,1 },{ -2,1 },{ 2,-1 },{ -2,-1 } };

int min(int a, int b) {
    return (a < b ? a : b);
}

int find1(int _y, int _x, int k) {

    if (_y == h-1 && _x == w-1) return 0;

    int& ret = cache[_y][_x][k];
    if (ret != -1) return ret;

    int temp = h*w;

    map[_y][_x] = 1;

    if (k > 0) {
        for (int i = 0; i < 8; i++) {
            int next_y = _y + dir_hor[i][y];
            int next_x = _x + dir_hor[i][x];

            if (next_y < 0 || next_y >= h || next_x < 0 || next_x >= w) continue;
            if (map[next_y][next_x] == 0) {
                temp = min(temp, find1(next_y, next_x, k - 1) + 1);
            }
        }
    }

    for (int i = 0; i < 4; i++) {
        int next_y = _y + dir_ord[i][y];
        int next_x = _x + dir_ord[i][x];

        if (next_y < 0 || next_y >= h || next_x < 0 || next_x >= w) continue;
        if (map[next_y][next_x] == 0) {
            temp = min(temp, find1(next_y, next_x, k) + 1);
        }
    }

    map[_y][_x] = 0;
    ret = temp;
    return temp;
}

int main(void) {

    memset(cache, -1, sizeof(cache));

    cin >> k >> w >> h;

    for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { scanf("%d", &map[i][j]); } }


    int answer = find1(0, 0, k);

    if (answer >= w*h || map[0][0] == 1) cout << -1 << endl;
    else cout << answer << endl;


}