#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;

string mmap[1005];
int dist1[1005][1005];
int dist2[1005][1005];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0 ,0};

bool is_out_of_range(int x, int y) {
	return x < 0 || x >= n || y < 0 || y >= m;
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		cin >> mmap[i];
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {

			dist1[i][j] = dist2[i][j] = -1;
		}
	}

	queue<pair<int, int>> que;
	que.push({0, 0});
	dist1[0][0] = 1;
	
	while (!que.empty()) {
		pair<int, int> here = que.front();
		que.pop();

		for (int i = 0; i < 4; i++) {
			int cx = here.first + dx[i];
			int cy = here.second + dy[i];

			if (is_out_of_range(cx, cy) || mmap[cx][cy] == '1' || dist1[cx][cy] != -1)
				continue;
			dist1[cx][cy] = dist1[here.first][here.second] + 1;
			que.push({ cx, cy });
		}
	}

	que.push({ n - 1, m - 1 });
	dist2[n - 1][m - 1] = 1;

	while (!que.empty()) {
		pair<int, int> here = que.front();
		que.pop();

		for (int i = 0; i < 4; i++) {
			int cx = here.first + dx[i];
			int cy = here.second + dy[i];

			if (is_out_of_range(cx, cy) || mmap[cx][cy] == '1' || dist2[cx][cy] != -1)
				continue;
			dist2[cx][cy] = dist2[here.first][here.second] + 1;
			que.push({ cx, cy });
		}
	}
	int res = 1234567890;

	if (dist1[n - 1][m - 1] != -1) {
		res = dist1[n - 1][m - 1];
	}


	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (mmap[i][j] == '0') continue;

			int min_1 = 1234567890;
			int min_2 = 1234567890;

			for (int d = 0; d < 4; d++) {
				int cx = i + dx[d];
				int cy = j + dy[d];

				if (is_out_of_range(cx, cy))
					continue;
				if (dist1[cx][cy] != -1)
					min_1 = min(min_1, dist1[cx][cy]);
				if (dist2[cx][cy] != -1)
					min_2 = min(min_2, dist2[cx][cy]);
			}
			if (min_1 == 1234567890 || min_2 == 1234567890)
				continue;
			res = min(res, min_1 + min_2 + 1);
			
		}
	}

	if (res == 1234567890)
		cout << "-1";
	else
		cout << res;

	return 0;
}