//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 1005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "maze"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, q, id;
int a[N][N];
map<ii,int> cnt;
int d[N][N], tim[N][N], TimeVisit;
int dis[1000001], f[1000001][21];
ii root;
int tplt[1000001], lt=0;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        freopen(Task".out","w",stdout);
    }
    cin >> n >> q;
    for(int i=1; i<=n; i++){
        string s; cin >> s;
        for(int j=1; j<=n; j++){
            a[i][j] = s[j-1]-'0';
            if (a[i][j]==0){
                cnt[ii(i,j)]=++id;
            }
        }
    }
}

int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};

bool OK(int x, int y){
    return 1 <= x && x <= n && 1 <= y && y <= n && a[x][y]==0;
}

void sub1(){
    while (q--){
        int ty; cin >> ty;
        if (ty==1){
            int u, v; cin >> u >> v;
            a[u][v]=1;
        }
        else{
            int u, v, x, y; cin >> u >> v >> x >> y;
            queue<ii> q;
            bool ok = false;
            q.push(ii(u,v)); TimeVisit++; d[u][v] = 1; tim[u][v] = TimeVisit;
            while (q.size()){
                int U = q.front().fi;
                int V = q.front().se;
                q.pop();
                if (U==x && V==y){
                    cout << d[U][V] << '\n';
                    ok = true;
                    break;
                }
                for(int i=0; i<4; i++){
                    int X = U + dx[i];
                    int Y = V + dy[i];
                    if (!OK(X,Y) || tim[X][Y]==TimeVisit) continue;
                    tim[X][Y] = TimeVisit;
                    d[X][Y] = d[U][V]+1;
                    q.push(ii(X,Y));
                }
            }
            if (!ok) cout << -1 << '\n';
        }
    }
}

void dfs(ii st, ii par){
    int u = cnt[st];
    for(int i=1; i<=20; i++){
        f[u][i] = f[f[u][i-1]][i-1];
    }
    for(int i=0; i<4; i++){
        int x = st.fi + dx[i];
        int y = st.se + dy[i];
        if (!OK(x,y) || (x==par.fi && y==par.se)) continue;
        int v = cnt[ii(x,y)];
        f[v][0] = u; dis[v] = dis[u] + 1;
        dfs(ii(x,y),st);
    }
}

int lca(int u, int v){
    if (dis[u] < dis[v]) swap(u,v);
    int delta = dis[u]-dis[v];
    for(int i=20; i>=0; i--) if ((delta>>i)&1) u = f[u][i];
    if (u==v) return u;
    for(int i=20; i>=0; i--){
        if (f[u][i]!=f[v][i]){
            u =f[u][i];
            v= f[v][i];
        }
    }
    return f[u][0];
}

int calc(int u, int v){
    int z = lca(u,v);
    return dis[u] + dis[v] - 2*dis[z];
}

void DFS(ii st, ii par){
    int u = cnt[st]; tplt[u] = lt;
    for(int i=0; i<4; i++){
        int x = st.fi + dx[i];
        int y = st.se + dy[i];
        if (!OK(x,y) || (x==par.fi && y==par.se)) continue;
        DFS(ii(x,y),st);
    }
}

void sub2(){
    for(int i=1; i<=n; i++){
        bool ok = false;
        for(int j=1; j<=n; j++){
            if (a[i][j]==1) continue;
            root = ii(i,j);
            ok = true;
            break;
        }
        if (ok) break;
    }
    dis[cnt[root]] = 1;
    dfs(root,ii(-1,-1));
    while (q--){
        int ty; cin >> ty;
        if (ty==2){
            int u, v, x, y; cin >> u >> v >> x >> y;
            int U = cnt[ii(u,v)];
            int V = cnt[ii(x,y)];
            if (tplt[U]==tplt[V] && tplt[U]!=-1)
                cout << calc(U,V)+1 << '\n';
            else cout << -1 << '\n';
        }
        else{
            int u, v; cin >> u >> v;
            a[u][v] = 1;
            int id = cnt[ii(u,v)]; tplt[id] = -1;
            for(int i=0; i<4; i++){
                int x = u + dx[i];
                int y = v + dy[i];
                if (!OK(x,y)) continue;
                lt++; DFS(ii(x,y),ii(u,v));
            }
        }
    }
}

void proc()
{
    //sub2(); exit(0);
    if (n <= 100 && q <= 100) sub1();
    else sub2();
}

signed main()
{
    readfile();
    proc();
    return 0;
}